./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-007.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:26,551 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:26,648 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae9f788a-6a29-4bc5-9707-87613e107a81/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:26,653 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:26,656 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:26,692 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:26,693 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:26,694 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:26,695 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:26,695 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:26,696 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:26,696 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:26,696 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:26,697 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:26,697 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:26,697 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:26,698 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:26,698 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:26,698 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:26,698 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:26,699 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:26,699 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:26,699 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:26,699 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:26,699 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:26,700 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:26,700 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:27,070 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:27,081 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:27,084 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:27,086 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:27,086 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:27,089 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae9f788a-6a29-4bc5-9707-87613e107a81/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-007.smt2
[2025-04-28 21:21:27,092 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:27,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:27,403 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae9f788a-6a29-4bc5-9707-87613e107a81/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-007.smt2
[2025-04-28 21:21:27,410 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:27,412 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:27,413 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:27,413 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:27,415 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:27,418 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,452 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27 Unit
[2025-04-28 21:21:27,453 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:27,454 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:27,454 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:27,454 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:27,472 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,472 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,506 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,506 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,515 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,516 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,518 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,525 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,526 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,554 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:27,555 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:27,555 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:27,555 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:27,559 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,562 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:27,579 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:27,598 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:27,604 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:27,623 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:27,623 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:27,623 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:27,623 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry.split given in one single declaration
[2025-04-28 21:21:27,624 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry.split
[2025-04-28 21:21:27,624 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry.split
[2025-04-28 21:21:27,624 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:27,624 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:27,624 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:27,624 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure fibo2 given in one single declaration
[2025-04-28 21:21:27,624 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2
[2025-04-28 21:21:27,624 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2
[2025-04-28 21:21:27,624 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure fibo2.AT.split given in one single declaration
[2025-04-28 21:21:27,624 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2.AT.split
[2025-04-28 21:21:27,624 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2.AT.split
[2025-04-28 21:21:27,625 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure fibo2.AT_tail given in one single declaration
[2025-04-28 21:21:27,625 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2.AT_tail
[2025-04-28 21:21:27,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2.AT_tail
[2025-04-28 21:21:27,625 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:27,625 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:27,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:27,722 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:27,725 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:27,915 INFO  L?                        ?]: Removed 39 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:27,915 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:27,932 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:27,933 INFO  L312             CfgBuilder]: Removed 3 assume(true) statements.
[2025-04-28 21:21:27,937 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:27 BoogieIcfgContainer
[2025-04-28 21:21:27,937 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:27,940 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:27,942 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:27,949 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:27,950 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:27" (1/3) ...
[2025-04-28 21:21:27,950 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d71e73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:27, skipping insertion in model container
[2025-04-28 21:21:27,950 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (2/3) ...
[2025-04-28 21:21:27,951 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d71e73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:27, skipping insertion in model container
[2025-04-28 21:21:27,951 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:27" (3/3) ...
[2025-04-28 21:21:27,952 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:27,970 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:27,973 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 7 procedures, 30 locations, 48 edges, 7 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:28,029 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:28,053 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@690e31f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:28,053 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:28,057 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 30 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-04-28 21:21:28,068 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:28,069 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,070 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,070 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,077 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 352560941, now seen corresponding path program 1 times
[2025-04-28 21:21:28,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,088 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602806125]
[2025-04-28 21:21:28,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,131 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:28,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:28,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:28,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,347 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602806125]
[2025-04-28 21:21:28,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602806125] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:28,348 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269354654]
[2025-04-28 21:21:28,348 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,348 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:28,351 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:28,353 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:28,355 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:28,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:28,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:28,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,429 INFO  L256         TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:28,433 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:28,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:28,468 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:28,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [269354654] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:28,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:28,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470972693]
[2025-04-28 21:21:28,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,480 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:28,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:28,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:28,520 INFO  L87              Difference]: Start difference. First operand  has 30 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:28,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,609 INFO  L93              Difference]: Finished difference Result 30 states and 41 transitions.
[2025-04-28 21:21:28,612 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:28,613 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 19
[2025-04-28 21:21:28,613 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,624 INFO  L225             Difference]: With dead ends: 30
[2025-04-28 21:21:28,624 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:28,629 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:28,633 INFO  L437           NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,635 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 76 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:28,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:28,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2025-04-28 21:21:28,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:28,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions.
[2025-04-28 21:21:28,725 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19
[2025-04-28 21:21:28,726 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,726 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 41 transitions.
[2025-04-28 21:21:28,727 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:28,727 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions.
[2025-04-28 21:21:28,728 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:28,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,729 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,738 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:28,936 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:28,937 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,937 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 949360226, now seen corresponding path program 1 times
[2025-04-28 21:21:28,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,938 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557485982]
[2025-04-28 21:21:28,938 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,948 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:28,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:28,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:29,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,070 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557485982]
[2025-04-28 21:21:29,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557485982] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,071 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459607120]
[2025-04-28 21:21:29,071 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,071 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,075 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,078 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:29,081 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:29,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:29,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,144 INFO  L256         TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:29,145 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:29,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:29,159 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:29,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [459607120] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:29,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:29,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:29,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581067176]
[2025-04-28 21:21:29,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:29,160 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:29,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:29,163 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:29,163 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:29,164 INFO  L87              Difference]: Start difference. First operand 30 states and 41 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:29,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:29,241 INFO  L93              Difference]: Finished difference Result 34 states and 53 transitions.
[2025-04-28 21:21:29,241 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:29,242 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 19
[2025-04-28 21:21:29,242 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:29,245 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:21:29,246 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:21:29,246 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:29,247 INFO  L437           NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:29,247 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:29,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:21:29,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30.
[2025-04-28 21:21:29,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:29,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions.
[2025-04-28 21:21:29,258 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19
[2025-04-28 21:21:29,258 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:29,258 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 41 transitions.
[2025-04-28 21:21:29,258 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:29,258 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions.
[2025-04-28 21:21:29,260 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-04-28 21:21:29,260 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,260 INFO  L218           NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:29,266 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:29,464 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,464 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,465 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,465 INFO  L85        PathProgramCache]: Analyzing trace with hash 1845869677, now seen corresponding path program 1 times
[2025-04-28 21:21:29,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,465 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110095849]
[2025-04-28 21:21:29,466 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,485 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:29,511 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:29,511 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,511 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:29,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,673 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110095849]
[2025-04-28 21:21:29,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110095849] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,673 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044164961]
[2025-04-28 21:21:29,674 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,674 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,681 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,687 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:29,692 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,801 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:29,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:29,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,848 INFO  L256         TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:29,851 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:29,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:21:29,886 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:29,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044164961] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:29,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:29,886 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:29,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921852990]
[2025-04-28 21:21:29,886 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:29,887 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:29,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:29,887 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:29,888 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:29,888 INFO  L87              Difference]: Start difference. First operand 30 states and 41 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11)
[2025-04-28 21:21:29,938 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:29,938 INFO  L93              Difference]: Finished difference Result 32 states and 46 transitions.
[2025-04-28 21:21:29,939 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:29,939 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 42
[2025-04-28 21:21:29,940 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:29,940 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:29,940 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:29,941 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:29,942 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:29,942 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:29,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:29,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:29,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (20), 11 states have call predecessors, (20), 11 states have call successors, (20)
[2025-04-28 21:21:29,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions.
[2025-04-28 21:21:29,949 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 42
[2025-04-28 21:21:29,949 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:29,950 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 46 transitions.
[2025-04-28 21:21:29,950 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11)
[2025-04-28 21:21:29,950 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions.
[2025-04-28 21:21:29,951 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-04-28 21:21:29,951 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,951 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:29,957 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:30,154 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,154 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,155 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -145174824, now seen corresponding path program 1 times
[2025-04-28 21:21:30,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,155 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21546024]
[2025-04-28 21:21:30,155 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:30,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:30,185 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,185 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:30,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,300 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21546024]
[2025-04-28 21:21:30,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21546024] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:30,300 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192743577]
[2025-04-28 21:21:30,300 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,300 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,304 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,306 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:30,310 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:30,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:30,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:30,428 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,428 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,429 INFO  L256         TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:30,431 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:30,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:21:30,479 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:30,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [192743577] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:30,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:30,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973606273]
[2025-04-28 21:21:30,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,481 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:30,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:30,482 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,482 INFO  L87              Difference]: Start difference. First operand 32 states and 46 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11)
[2025-04-28 21:21:30,547 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,547 INFO  L93              Difference]: Finished difference Result 34 states and 50 transitions.
[2025-04-28 21:21:30,548 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:30,548 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 42
[2025-04-28 21:21:30,548 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,549 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:21:30,549 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:21:30,549 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,550 INFO  L437           NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,551 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:30,551 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:21:30,556 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30.
[2025-04-28 21:21:30,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:30,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions.
[2025-04-28 21:21:30,561 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 42
[2025-04-28 21:21:30,561 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,561 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 40 transitions.
[2025-04-28 21:21:30,562 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11)
[2025-04-28 21:21:30,562 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions.
[2025-04-28 21:21:30,565 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:30,565 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,565 INFO  L218           NwaCegarLoop]: trace histogram [10, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,572 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:30,766 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,766 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,766 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -554895065, now seen corresponding path program 2 times
[2025-04-28 21:21:30,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,767 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970797255]
[2025-04-28 21:21:30,767 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:30,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,802 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:30,819 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:30,823 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:30,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:30,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,952 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970797255]
[2025-04-28 21:21:30,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970797255] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:30,952 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942896696]
[2025-04-28 21:21:30,952 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:30,952 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,955 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,957 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:30,961 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,048 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:31,123 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:31,123 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:31,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,126 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,129 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:31,170 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:31,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942896696] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:31,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5
[2025-04-28 21:21:31,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020205772]
[2025-04-28 21:21:31,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,171 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,172 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:31,172 INFO  L87              Difference]: Start difference. First operand 30 states and 40 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17)
[2025-04-28 21:21:31,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,210 INFO  L93              Difference]: Finished difference Result 32 states and 44 transitions.
[2025-04-28 21:21:31,210 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,210 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 65
[2025-04-28 21:21:31,211 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,212 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:31,212 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:31,212 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:31,213 INFO  L437           NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,213 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:31,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:31,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:31,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18)
[2025-04-28 21:21:31,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions.
[2025-04-28 21:21:31,220 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 65
[2025-04-28 21:21:31,220 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,220 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 44 transitions.
[2025-04-28 21:21:31,221 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17)
[2025-04-28 21:21:31,221 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions.
[2025-04-28 21:21:31,222 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:31,222 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,222 INFO  L218           NwaCegarLoop]: trace histogram [10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,228 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:31,423 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,423 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,423 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 955356605, now seen corresponding path program 2 times
[2025-04-28 21:21:31,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,424 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980970040]
[2025-04-28 21:21:31,424 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:31,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,449 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:31,463 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:31,463 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:31,463 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:31,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,600 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980970040]
[2025-04-28 21:21:31,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980970040] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,602 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293846024]
[2025-04-28 21:21:31,603 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:31,603 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,605 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,608 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:31,611 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,685 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:31,750 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:31,750 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:31,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,752 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,755 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-04-28 21:21:31,799 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:31,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293846024] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:31,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:31,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968540157]
[2025-04-28 21:21:31,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,800 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:31,801 INFO  L87              Difference]: Start difference. First operand 32 states and 44 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15)
[2025-04-28 21:21:31,837 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,838 INFO  L93              Difference]: Finished difference Result 32 states and 43 transitions.
[2025-04-28 21:21:31,839 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,839 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 65
[2025-04-28 21:21:31,839 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,840 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:31,841 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:31,842 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:31,842 INFO  L437           NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,844 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:31,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:31,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:31,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17)
[2025-04-28 21:21:31,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions.
[2025-04-28 21:21:31,855 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 65
[2025-04-28 21:21:31,856 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,857 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 43 transitions.
[2025-04-28 21:21:31,857 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15)
[2025-04-28 21:21:31,857 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions.
[2025-04-28 21:21:31,858 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:31,859 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,859 INFO  L218           NwaCegarLoop]: trace histogram [10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,865 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:32,059 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,059 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,060 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -491570093, now seen corresponding path program 3 times
[2025-04-28 21:21:32,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,060 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233904881]
[2025-04-28 21:21:32,060 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:32,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,086 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes.
[2025-04-28 21:21:32,116 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 65 statements.
[2025-04-28 21:21:32,118 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:32,118 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2025-04-28 21:21:32,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,309 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233904881]
[2025-04-28 21:21:32,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233904881] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:32,311 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766241791]
[2025-04-28 21:21:32,311 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:32,311 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,314 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:32,319 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:32,320 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,402 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes.
[2025-04-28 21:21:32,462 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 65 statements.
[2025-04-28 21:21:32,462 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:32,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,464 INFO  L256         TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:32,466 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-04-28 21:21:32,502 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:32,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [766241791] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:32,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-04-28 21:21:32,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917930129]
[2025-04-28 21:21:32,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,503 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:32,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,504 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:32,504 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:32,504 INFO  L87              Difference]: Start difference. First operand 32 states and 43 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17)
[2025-04-28 21:21:32,530 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,530 INFO  L93              Difference]: Finished difference Result 32 states and 42 transitions.
[2025-04-28 21:21:32,531 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:32,531 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 65
[2025-04-28 21:21:32,531 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,532 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:32,532 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:32,532 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:32,533 INFO  L437           NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,533 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:32,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:32,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:32,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:32,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions.
[2025-04-28 21:21:32,539 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 65
[2025-04-28 21:21:32,539 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,539 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 42 transitions.
[2025-04-28 21:21:32,539 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17)
[2025-04-28 21:21:32,540 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2025-04-28 21:21:32,541 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:32,541 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,541 INFO  L218           NwaCegarLoop]: trace histogram [10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,547 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:32,742 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2025-04-28 21:21:32,742 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,742 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 961256937, now seen corresponding path program 4 times
[2025-04-28 21:21:32,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,743 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331382778]
[2025-04-28 21:21:32,743 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:32,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,759 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:32,768 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 64 of 65 statements.
[2025-04-28 21:21:32,768 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:32,768 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:32,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,853 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331382778]
[2025-04-28 21:21:32,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331382778] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:32,853 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096530649]
[2025-04-28 21:21:32,853 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:32,853 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,856 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:32,858 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:32,862 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,931 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:33,042 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 64 of 65 statements.
[2025-04-28 21:21:33,042 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:33,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,044 INFO  L256         TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,046 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-04-28 21:21:33,073 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:33,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096530649] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:33,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:33,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886492705]
[2025-04-28 21:21:33,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,074 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:33,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,074 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:33,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:33,075 INFO  L87              Difference]: Start difference. First operand 32 states and 42 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13)
[2025-04-28 21:21:33,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,098 INFO  L93              Difference]: Finished difference Result 32 states and 41 transitions.
[2025-04-28 21:21:33,098 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:33,099 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13) Word has length 65
[2025-04-28 21:21:33,099 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,099 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:33,099 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:33,100 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:33,100 INFO  L437           NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,101 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:33,101 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:33,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2025-04-28 21:21:33,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:33,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions.
[2025-04-28 21:21:33,105 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 65
[2025-04-28 21:21:33,105 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,105 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 38 transitions.
[2025-04-28 21:21:33,105 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 3 states have call successors, (13)
[2025-04-28 21:21:33,106 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions.
[2025-04-28 21:21:33,107 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:33,107 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,107 INFO  L218           NwaCegarLoop]: trace histogram [10, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,113 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:33,311 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,311 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,311 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 628327059, now seen corresponding path program 1 times
[2025-04-28 21:21:33,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,312 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611089579]
[2025-04-28 21:21:33,312 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,327 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:33,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:33,353 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:33,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,964 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611089579]
[2025-04-28 21:21:33,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611089579] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,965 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368505961]
[2025-04-28 21:21:33,965 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,965 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,968 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,971 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,974 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:34,132 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:34,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,136 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,140 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:34,744 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:39,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:39,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [368505961] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:39,108 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:39,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9
[2025-04-28 21:21:39,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049917177]
[2025-04-28 21:21:39,109 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,109 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:39,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:39,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,110 INFO  L87              Difference]: Start difference. First operand 30 states and 38 transitions. Second operand  has 9 states, 5 states have (on average 3.4) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20)
[2025-04-28 21:21:39,236 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,237 INFO  L93              Difference]: Finished difference Result 36 states and 54 transitions.
[2025-04-28 21:21:39,237 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:39,238 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 3.4) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 65
[2025-04-28 21:21:39,238 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,239 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:21:39,239 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:21:39,240 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,241 INFO  L437           NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,242 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:21:39,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2025-04-28 21:21:39,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (27), 15 states have call predecessors, (27), 13 states have call successors, (27)
[2025-04-28 21:21:39,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions.
[2025-04-28 21:21:39,254 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 65
[2025-04-28 21:21:39,254 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,256 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 54 transitions.
[2025-04-28 21:21:39,256 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 3.4) internal successors, (17), 8 states have internal predecessors, (17), 6 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20)
[2025-04-28 21:21:39,256 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions.
[2025-04-28 21:21:39,258 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-04-28 21:21:39,258 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,258 INFO  L218           NwaCegarLoop]: trace histogram [18, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,265 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:39,459 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:39,459 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,459 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,459 INFO  L85        PathProgramCache]: Analyzing trace with hash 935602939, now seen corresponding path program 2 times
[2025-04-28 21:21:39,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,459 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534191187]
[2025-04-28 21:21:39,459 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:39,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,480 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes.
[2025-04-28 21:21:39,515 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements.
[2025-04-28 21:21:39,515 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:39,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 525 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked.
[2025-04-28 21:21:40,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,366 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534191187]
[2025-04-28 21:21:40,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534191187] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,366 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952026578]
[2025-04-28 21:21:40,366 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:40,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,369 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,372 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:40,376 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,474 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes.
[2025-04-28 21:21:40,572 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements.
[2025-04-28 21:21:40,572 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:40,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,575 INFO  L256         TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,578 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 525 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked.
[2025-04-28 21:21:41,065 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 525 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked.
[2025-04-28 21:21:44,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952026578] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:44,528 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:44,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2025-04-28 21:21:44,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75008268]
[2025-04-28 21:21:44,529 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,529 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:44,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,530 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:44,530 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:44,530 INFO  L87              Difference]: Start difference. First operand 36 states and 54 transitions. Second operand  has 10 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21)
[2025-04-28 21:21:44,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,756 INFO  L93              Difference]: Finished difference Result 49 states and 100 transitions.
[2025-04-28 21:21:44,756 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:44,756 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 111
[2025-04-28 21:21:44,757 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,758 INFO  L225             Difference]: With dead ends: 49
[2025-04-28 21:21:44,758 INFO  L226             Difference]: Without dead ends: 49
[2025-04-28 21:21:44,758 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:44,759 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,759 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 176 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:44,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-04-28 21:21:44,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38.
[2025-04-28 21:21:44,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 15 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (31), 17 states have call predecessors, (31), 15 states have call successors, (31)
[2025-04-28 21:21:44,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions.
[2025-04-28 21:21:44,774 INFO  L79                 Accepts]: Start accepts. Automaton has 38 states and 60 transitions. Word has length 111
[2025-04-28 21:21:44,775 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,775 INFO  L485      AbstractCegarLoop]: Abstraction has 38 states and 60 transitions.
[2025-04-28 21:21:44,776 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21)
[2025-04-28 21:21:44,776 INFO  L278                IsEmpty]: Start isEmpty. Operand 38 states and 60 transitions.
[2025-04-28 21:21:44,778 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-04-28 21:21:44,778 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,778 INFO  L218           NwaCegarLoop]: trace histogram [26, 20, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,783 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-04-28 21:21:44,978 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,979 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,979 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 1560504789, now seen corresponding path program 3 times
[2025-04-28 21:21:44,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,980 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175140950]
[2025-04-28 21:21:44,980 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:44,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,004 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 13 equivalence classes.
[2025-04-28 21:21:45,096 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 81 of 157 statements.
[2025-04-28 21:21:45,097 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-04-28 21:21:45,097 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 6 proven. 127 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked.
[2025-04-28 21:21:45,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,756 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175140950]
[2025-04-28 21:21:45,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175140950] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,757 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947444842]
[2025-04-28 21:21:45,757 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:45,757 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,759 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,761 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:45,764 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,898 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 13 equivalence classes.
[2025-04-28 21:21:45,984 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 81 of 157 statements.
[2025-04-28 21:21:45,984 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-04-28 21:21:45,984 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,987 INFO  L256         TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,991 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:46,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 376 proven. 8 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked.
[2025-04-28 21:21:46,883 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:54,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 6 proven. 127 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked.
[2025-04-28 21:21:54,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [947444842] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:54,505 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:54,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12
[2025-04-28 21:21:54,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482392565]
[2025-04-28 21:21:54,505 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,506 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:54,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:54,507 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:54,507 INFO  L87              Difference]: Start difference. First operand 38 states and 60 transitions. Second operand  has 12 states, 7 states have (on average 4.0) internal successors, (28), 12 states have internal predecessors, (28), 9 states have call successors, (31), 2 states have call predecessors, (31), 7 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34)
[2025-04-28 21:21:54,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,655 INFO  L93              Difference]: Finished difference Result 44 states and 80 transitions.
[2025-04-28 21:21:54,659 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:54,659 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 7 states have (on average 4.0) internal successors, (28), 12 states have internal predecessors, (28), 9 states have call successors, (31), 2 states have call predecessors, (31), 7 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) Word has length 157
[2025-04-28 21:21:54,660 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,661 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:54,661 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:54,661 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 308 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:54,661 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,662 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 196 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:54,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:54,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44.
[2025-04-28 21:21:54,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 17 states have call successors, (17), 6 states have call predecessors, (17), 11 states have return successors, (47), 21 states have call predecessors, (47), 17 states have call successors, (47)
[2025-04-28 21:21:54,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 80 transitions.
[2025-04-28 21:21:54,682 INFO  L79                 Accepts]: Start accepts. Automaton has 44 states and 80 transitions. Word has length 157
[2025-04-28 21:21:54,682 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,682 INFO  L485      AbstractCegarLoop]: Abstraction has 44 states and 80 transitions.
[2025-04-28 21:21:54,682 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 7 states have (on average 4.0) internal successors, (28), 12 states have internal predecessors, (28), 9 states have call successors, (31), 2 states have call predecessors, (31), 7 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34)
[2025-04-28 21:21:54,683 INFO  L278                IsEmpty]: Start isEmpty. Operand 44 states and 80 transitions.
[2025-04-28 21:21:54,685 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-04-28 21:21:54,685 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,685 INFO  L218           NwaCegarLoop]: trace histogram [34, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,695 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-04-28 21:21:54,892 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:54,892 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,893 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 2081313719, now seen corresponding path program 4 times
[2025-04-28 21:21:54,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,893 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296171853]
[2025-04-28 21:21:54,893 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:54,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,922 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 203 statements into 2 equivalence classes.
[2025-04-28 21:21:54,954 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 202 of 203 statements.
[2025-04-28 21:21:54,955 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:54,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 1991 backedges. 50 proven. 198 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked.
[2025-04-28 21:21:55,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,259 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296171853]
[2025-04-28 21:21:55,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296171853] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:55,260 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684214681]
[2025-04-28 21:21:55,260 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:55,260 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,262 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:55,264 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:55,269 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:21:55,437 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 203 statements into 2 equivalence classes.
[2025-04-28 21:21:55,604 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 202 of 203 statements.
[2025-04-28 21:21:55,604 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:55,604 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,609 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:55,629 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:55,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 1991 backedges. 656 proven. 3 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked.
[2025-04-28 21:21:55,663 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:56,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 1991 backedges. 50 proven. 198 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked.
[2025-04-28 21:21:56,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [684214681] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:56,820 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:56,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6
[2025-04-28 21:21:56,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513330198]
[2025-04-28 21:21:56,820 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,821 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:56,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:56,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:56,822 INFO  L87              Difference]: Start difference. First operand 44 states and 80 transitions. Second operand  has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26)
[2025-04-28 21:21:56,916 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:56,916 INFO  L93              Difference]: Finished difference Result 43 states and 67 transitions.
[2025-04-28 21:21:56,916 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:56,916 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) Word has length 203
[2025-04-28 21:21:56,917 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:56,917 INFO  L225             Difference]: With dead ends: 43
[2025-04-28 21:21:56,917 INFO  L226             Difference]: Without dead ends: 43
[2025-04-28 21:21:56,917 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:56,918 INFO  L437           NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:56,918 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:56,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2025-04-28 21:21:56,927 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41.
[2025-04-28 21:21:56,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 17 states have call successors, (17), 7 states have call predecessors, (17), 9 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33)
[2025-04-28 21:21:56,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions.
[2025-04-28 21:21:56,928 INFO  L79                 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 203
[2025-04-28 21:21:56,928 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:56,928 INFO  L485      AbstractCegarLoop]: Abstraction has 41 states and 65 transitions.
[2025-04-28 21:21:56,928 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26)
[2025-04-28 21:21:56,928 INFO  L278                IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions.
[2025-04-28 21:21:56,931 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-04-28 21:21:56,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:56,931 INFO  L218           NwaCegarLoop]: trace histogram [42, 32, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:56,938 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:57,132 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:57,132 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,132 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,133 INFO  L85        PathProgramCache]: Analyzing trace with hash -903989993, now seen corresponding path program 5 times
[2025-04-28 21:21:57,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,133 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039116341]
[2025-04-28 21:21:57,133 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:57,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,168 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 249 statements into 17 equivalence classes.
[2025-04-28 21:21:57,574 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 249 of 249 statements.
[2025-04-28 21:21:57,574 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s)
[2025-04-28 21:21:57,574 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
