./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-188.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:29,268 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:29,363 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db427951-ad6f-4acc-bce2-d1c1738a08b1/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:29,373 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:29,373 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:29,410 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:29,411 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:29,411 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:29,411 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:29,411 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:29,412 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:29,412 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:29,412 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:29,413 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:29,413 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:29,414 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:29,414 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:29,414 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:29,414 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:29,414 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:29,414 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:29,414 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:29,414 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:29,415 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:29,415 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:29,416 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:29,416 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:29,753 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:29,766 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:29,768 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:29,771 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:29,771 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:29,774 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db427951-ad6f-4acc-bce2-d1c1738a08b1/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-188.smt2
[2025-04-28 21:21:29,776 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:29,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:30,040 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db427951-ad6f-4acc-bce2-d1c1738a08b1/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-188.smt2
[2025-04-28 21:21:30,044 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:30,047 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:30,048 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:30,049 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:30,049 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:30,052 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,087 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30 Unit
[2025-04-28 21:21:30,088 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:30,089 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,089 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:30,089 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:30,107 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,108 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,136 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,136 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,139 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,140 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,142 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,143 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,143 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,154 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,155 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:30,156 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:30,156 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:30,157 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,162 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:30,176 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,190 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:30,193 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:30,207 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:30,207 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:30,208 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:30,208 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main20 given in one single declaration
[2025-04-28 21:21:30,208 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main20
[2025-04-28 21:21:30,208 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main20
[2025-04-28 21:21:30,208 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main15 given in one single declaration
[2025-04-28 21:21:30,208 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main15
[2025-04-28 21:21:30,208 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main15
[2025-04-28 21:21:30,208 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main12 given in one single declaration
[2025-04-28 21:21:30,208 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main12
[2025-04-28 21:21:30,208 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main12
[2025-04-28 21:21:30,209 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main7 given in one single declaration
[2025-04-28 21:21:30,209 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main7
[2025-04-28 21:21:30,209 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main7
[2025-04-28 21:21:30,209 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main3 given in one single declaration
[2025-04-28 21:21:30,209 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main3
[2025-04-28 21:21:30,209 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main3
[2025-04-28 21:21:30,209 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main8 given in one single declaration
[2025-04-28 21:21:30,209 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main8
[2025-04-28 21:21:30,209 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main8
[2025-04-28 21:21:30,209 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:30,209 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:30,210 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:30,277 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:30,281 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:30,476 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:30,476 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:30,489 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:30,489 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:30,490 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:30 BoogieIcfgContainer
[2025-04-28 21:21:30,490 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:30,497 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:30,497 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:30,501 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:30,501 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:30" (1/3) ...
[2025-04-28 21:21:30,502 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6773f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:30, skipping insertion in model container
[2025-04-28 21:21:30,503 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (2/3) ...
[2025-04-28 21:21:30,503 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6773f9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:30, skipping insertion in model container
[2025-04-28 21:21:30,503 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:30" (3/3) ...
[2025-04-28 21:21:30,505 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:30,527 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:30,530 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 8 procedures, 38 locations, 62 edges, 8 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:30,577 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:30,595 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;@13dae6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:30,595 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:30,600 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 38 states, 16 states have (on average 1.4375) internal successors, (23), 23 states have internal predecessors, (23), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 7 states have call predecessors, (13), 13 states have call successors, (13)
[2025-04-28 21:21:30,611 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:30,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,612 INFO  L218           NwaCegarLoop]: trace histogram [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:30,612 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,619 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -152454164, now seen corresponding path program 1 times
[2025-04-28 21:21:30,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,629 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018430299]
[2025-04-28 21:21:30,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:30,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:30,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:31,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,195 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018430299]
[2025-04-28 21:21:31,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018430299] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:31,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018113648]
[2025-04-28 21:21:31,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,211 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:31,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,245 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:31,245 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:31,248 INFO  L87              Difference]: Start difference. First operand  has 38 states, 16 states have (on average 1.4375) internal successors, (23), 23 states have internal predecessors, (23), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 7 states have call predecessors, (13), 13 states have call successors, (13) Second operand  has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6)
[2025-04-28 21:21:31,474 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,475 INFO  L93              Difference]: Finished difference Result 44 states and 58 transitions.
[2025-04-28 21:21:31,478 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:31,479 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25
[2025-04-28 21:21:31,480 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,489 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:31,489 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:31,529 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:31,536 INFO  L437           NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,538 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:31,614 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:31,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2025-04-28 21:21:31,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 24 states have internal predecessors, (24), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19)
[2025-04-28 21:21:31,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions.
[2025-04-28 21:21:31,673 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 25
[2025-04-28 21:21:31,673 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,673 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 56 transitions.
[2025-04-28 21:21:31,674 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6)
[2025-04-28 21:21:31,674 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions.
[2025-04-28 21:21:31,682 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:31,683 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,687 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:31,687 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:31,688 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,689 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -15458671, now seen corresponding path program 1 times
[2025-04-28 21:21:31,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,689 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388389212]
[2025-04-28 21:21:31,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,713 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:31,736 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:31,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,737 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:31,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,938 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388389212]
[2025-04-28 21:21:31,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388389212] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:31,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721150490]
[2025-04-28 21:21:31,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,940 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:31,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:31,941 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:31,941 INFO  L87              Difference]: Start difference. First operand 42 states and 56 transitions. Second operand  has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:32,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,072 INFO  L93              Difference]: Finished difference Result 55 states and 79 transitions.
[2025-04-28 21:21:32,074 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:32,074 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29
[2025-04-28 21:21:32,074 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,076 INFO  L225             Difference]: With dead ends: 55
[2025-04-28 21:21:32,077 INFO  L226             Difference]: Without dead ends: 55
[2025-04-28 21:21:32,078 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32,079 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,080 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 180 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:32,083 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2025-04-28 21:21:32,094 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2025-04-28 21:21:32,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 31 states have internal predecessors, (34), 17 states have call successors, (17), 10 states have call predecessors, (17), 13 states have return successors, (28), 13 states have call predecessors, (28), 17 states have call successors, (28)
[2025-04-28 21:21:32,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions.
[2025-04-28 21:21:32,101 INFO  L79                 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 29
[2025-04-28 21:21:32,102 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,102 INFO  L485      AbstractCegarLoop]: Abstraction has 55 states and 79 transitions.
[2025-04-28 21:21:32,102 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:32,102 INFO  L278                IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions.
[2025-04-28 21:21:32,106 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:32,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,106 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:32,107 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:32,107 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,107 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -622745362, now seen corresponding path program 1 times
[2025-04-28 21:21:32,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,108 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265428091]
[2025-04-28 21:21:32,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:32,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:32,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:32,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,339 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265428091]
[2025-04-28 21:21:32,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265428091] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:32,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:32,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564491104]
[2025-04-28 21:21:32,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,340 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:32,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:32,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:32,341 INFO  L87              Difference]: Start difference. First operand 55 states and 79 transitions. Second operand  has 7 states, 5 states have (on average 3.0) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:32,464 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,464 INFO  L93              Difference]: Finished difference Result 57 states and 81 transitions.
[2025-04-28 21:21:32,465 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:32,465 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 3.0) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:32,466 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,467 INFO  L225             Difference]: With dead ends: 57
[2025-04-28 21:21:32,469 INFO  L226             Difference]: Without dead ends: 53
[2025-04-28 21:21:32,469 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:32,470 INFO  L437           NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,470 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 251 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:32,471 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2025-04-28 21:21:32,480 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51.
[2025-04-28 21:21:32,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (23), 11 states have call predecessors, (23), 17 states have call successors, (23)
[2025-04-28 21:21:32,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions.
[2025-04-28 21:21:32,482 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 29
[2025-04-28 21:21:32,482 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,482 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 72 transitions.
[2025-04-28 21:21:32,482 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 3.0) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:32,482 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions.
[2025-04-28 21:21:32,484 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:32,484 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,484 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:32,485 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:32,485 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,485 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,486 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083305679, now seen corresponding path program 1 times
[2025-04-28 21:21:32,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,486 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994209723]
[2025-04-28 21:21:32,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:32,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:32,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,706 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:32,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,707 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994209723]
[2025-04-28 21:21:32,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994209723] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:32,707 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275721394]
[2025-04-28 21:21:32,707 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,707 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,710 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:32,713 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:32,717 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,773 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:32,811 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:32,811 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,812 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,814 INFO  L256         TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:32,821 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,938 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:32,938 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:34,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:34,353 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275721394] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:34,353 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 11
[2025-04-28 21:21:34,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547146633]
[2025-04-28 21:21:34,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,354 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:34,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:34,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:34,355 INFO  L87              Difference]: Start difference. First operand 51 states and 72 transitions. Second operand  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:34,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,463 INFO  L93              Difference]: Finished difference Result 61 states and 87 transitions.
[2025-04-28 21:21:34,464 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:34,464 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:34,464 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,466 INFO  L225             Difference]: With dead ends: 61
[2025-04-28 21:21:34,467 INFO  L226             Difference]: Without dead ends: 61
[2025-04-28 21:21:34,467 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:34,469 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,470 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 231 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,470 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2025-04-28 21:21:34,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57.
[2025-04-28 21:21:34,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57 states, 25 states have (on average 1.4) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 10 states have call predecessors, (17), 14 states have return successors, (28), 14 states have call predecessors, (28), 17 states have call successors, (28)
[2025-04-28 21:21:34,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions.
[2025-04-28 21:21:34,484 INFO  L79                 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29
[2025-04-28 21:21:34,484 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,484 INFO  L485      AbstractCegarLoop]: Abstraction has 57 states and 80 transitions.
[2025-04-28 21:21:34,484 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:34,485 INFO  L278                IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions.
[2025-04-28 21:21:34,486 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:34,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,486 INFO  L218           NwaCegarLoop]: trace histogram [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:34,493 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:34,687 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,687 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,688 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 630464038, now seen corresponding path program 1 times
[2025-04-28 21:21:34,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,688 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953175224]
[2025-04-28 21:21:34,688 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:34,700 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:34,700 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,700 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:34,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,836 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953175224]
[2025-04-28 21:21:34,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953175224] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:34,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909761981]
[2025-04-28 21:21:34,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,837 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:34,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:34,838 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:34,838 INFO  L87              Difference]: Start difference. First operand 57 states and 80 transitions. Second operand  has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:34,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,973 INFO  L93              Difference]: Finished difference Result 73 states and 102 transitions.
[2025-04-28 21:21:34,973 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:34,973 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) Word has length 29
[2025-04-28 21:21:34,974 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,975 INFO  L225             Difference]: With dead ends: 73
[2025-04-28 21:21:34,975 INFO  L226             Difference]: Without dead ends: 71
[2025-04-28 21:21:34,975 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:34,976 INFO  L437           NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,976 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 329 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,977 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2025-04-28 21:21:34,986 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67.
[2025-04-28 21:21:34,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 67 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 37 states have internal predecessors, (40), 17 states have call successors, (17), 10 states have call predecessors, (17), 19 states have return successors, (38), 19 states have call predecessors, (38), 17 states have call successors, (38)
[2025-04-28 21:21:34,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions.
[2025-04-28 21:21:34,988 INFO  L79                 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 29
[2025-04-28 21:21:34,988 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,988 INFO  L485      AbstractCegarLoop]: Abstraction has 67 states and 95 transitions.
[2025-04-28 21:21:34,988 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:34,988 INFO  L278                IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions.
[2025-04-28 21:21:34,990 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:34,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,990 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 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:34,990 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:34,990 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,991 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -1256264077, now seen corresponding path program 1 times
[2025-04-28 21:21:34,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,991 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715280076]
[2025-04-28 21:21:34,991 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,998 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:35,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:35,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:35,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,450 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715280076]
[2025-04-28 21:21:35,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715280076] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,450 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831537263]
[2025-04-28 21:21:35,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,450 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,455 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:35,457 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:35,461 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:35,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:35,557 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,561 INFO  L256         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 37 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:35,563 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:35,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:35,851 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:37,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:37,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [831537263] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:37,215 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:37,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22
[2025-04-28 21:21:37,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672335316]
[2025-04-28 21:21:37,216 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,216 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:37,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:37,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:37,217 INFO  L87              Difference]: Start difference. First operand 67 states and 95 transitions. Second operand  has 22 states, 16 states have (on average 1.75) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (11), 1 states have call predecessors, (11), 15 states have return successors, (18), 13 states have call predecessors, (18), 7 states have call successors, (18)
[2025-04-28 21:21:37,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,501 INFO  L93              Difference]: Finished difference Result 83 states and 119 transitions.
[2025-04-28 21:21:37,501 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:37,501 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 1.75) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (11), 1 states have call predecessors, (11), 15 states have return successors, (18), 13 states have call predecessors, (18), 7 states have call successors, (18) Word has length 33
[2025-04-28 21:21:37,502 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,503 INFO  L225             Difference]: With dead ends: 83
[2025-04-28 21:21:37,503 INFO  L226             Difference]: Without dead ends: 81
[2025-04-28 21:21:37,504 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:37,505 INFO  L437           NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,505 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 552 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:37,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-04-28 21:21:37,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73.
[2025-04-28 21:21:37,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 33 states have (on average 1.303030303030303) internal successors, (43), 40 states have internal predecessors, (43), 17 states have call successors, (17), 10 states have call predecessors, (17), 22 states have return successors, (45), 22 states have call predecessors, (45), 17 states have call successors, (45)
[2025-04-28 21:21:37,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions.
[2025-04-28 21:21:37,523 INFO  L79                 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 33
[2025-04-28 21:21:37,523 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,523 INFO  L485      AbstractCegarLoop]: Abstraction has 73 states and 105 transitions.
[2025-04-28 21:21:37,523 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 1.75) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (11), 1 states have call predecessors, (11), 15 states have return successors, (18), 13 states have call predecessors, (18), 7 states have call successors, (18)
[2025-04-28 21:21:37,523 INFO  L278                IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions.
[2025-04-28 21:21:37,524 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:37,525 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,529 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:37,534 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:37,729 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,730 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,730 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 703959592, now seen corresponding path program 1 times
[2025-04-28 21:21:37,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,730 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351411566]
[2025-04-28 21:21:37,730 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:37,742 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:37,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:37,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,864 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351411566]
[2025-04-28 21:21:37,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351411566] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:37,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:37,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275478418]
[2025-04-28 21:21:37,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,865 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:37,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:37,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:37,866 INFO  L87              Difference]: Start difference. First operand 73 states and 105 transitions. Second operand  has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:37,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,983 INFO  L93              Difference]: Finished difference Result 93 states and 131 transitions.
[2025-04-28 21:21:37,984 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:37,984 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33
[2025-04-28 21:21:37,984 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,986 INFO  L225             Difference]: With dead ends: 93
[2025-04-28 21:21:37,986 INFO  L226             Difference]: Without dead ends: 87
[2025-04-28 21:21:37,986 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:37,987 INFO  L437           NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,987 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 286 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:37,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2025-04-28 21:21:38,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83.
[2025-04-28 21:21:38,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 38 states have (on average 1.263157894736842) internal successors, (48), 45 states have internal predecessors, (48), 17 states have call successors, (17), 10 states have call predecessors, (17), 27 states have return successors, (53), 27 states have call predecessors, (53), 17 states have call successors, (53)
[2025-04-28 21:21:38,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions.
[2025-04-28 21:21:38,015 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 33
[2025-04-28 21:21:38,016 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,016 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 118 transitions.
[2025-04-28 21:21:38,016 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:38,016 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions.
[2025-04-28 21:21:38,017 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:38,017 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,018 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:38,018 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:38,019 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,021 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,021 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870170677, now seen corresponding path program 1 times
[2025-04-28 21:21:38,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,021 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370423382]
[2025-04-28 21:21:38,022 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,032 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:38,038 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:38,038 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,038 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,187 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:38,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,187 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370423382]
[2025-04-28 21:21:38,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370423382] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,187 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000194637]
[2025-04-28 21:21:38,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,187 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,190 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,192 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:38,195 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:38,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:38,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,285 INFO  L256         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,287 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,333 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:38,333 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:39,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:39,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000194637] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:39,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 11
[2025-04-28 21:21:39,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591478815]
[2025-04-28 21:21:39,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,634 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:39,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,634 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:39,634 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:39,635 INFO  L87              Difference]: Start difference. First operand 83 states and 118 transitions. Second operand  has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:39,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,731 INFO  L93              Difference]: Finished difference Result 97 states and 133 transitions.
[2025-04-28 21:21:39,731 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:39,731 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33
[2025-04-28 21:21:39,732 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,733 INFO  L225             Difference]: With dead ends: 97
[2025-04-28 21:21:39,733 INFO  L226             Difference]: Without dead ends: 93
[2025-04-28 21:21:39,733 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:39,734 INFO  L437           NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,734 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 246 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-04-28 21:21:39,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91.
[2025-04-28 21:21:39,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 49 states have internal predecessors, (52), 17 states have call successors, (17), 10 states have call predecessors, (17), 31 states have return successors, (58), 31 states have call predecessors, (58), 17 states have call successors, (58)
[2025-04-28 21:21:39,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions.
[2025-04-28 21:21:39,752 INFO  L79                 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 33
[2025-04-28 21:21:39,753 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,753 INFO  L485      AbstractCegarLoop]: Abstraction has 91 states and 127 transitions.
[2025-04-28 21:21:39,753 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:39,753 INFO  L278                IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions.
[2025-04-28 21:21:39,758 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:39,759 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,759 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:39,768 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:39,959 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,959 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,960 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,960 INFO  L85        PathProgramCache]: Analyzing trace with hash 496571211, now seen corresponding path program 1 times
[2025-04-28 21:21:39,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,960 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688042414]
[2025-04-28 21:21:39,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:39,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:39,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:40,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,064 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688042414]
[2025-04-28 21:21:40,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688042414] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:40,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869310113]
[2025-04-28 21:21:40,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,065 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:40,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,066 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:40,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:40,066 INFO  L87              Difference]: Start difference. First operand 91 states and 127 transitions. Second operand  has 7 states, 5 states have (on average 3.4) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:40,137 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,137 INFO  L93              Difference]: Finished difference Result 101 states and 136 transitions.
[2025-04-28 21:21:40,138 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:40,139 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 3.4) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33
[2025-04-28 21:21:40,139 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,140 INFO  L225             Difference]: With dead ends: 101
[2025-04-28 21:21:40,142 INFO  L226             Difference]: Without dead ends: 91
[2025-04-28 21:21:40,142 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:40,143 INFO  L437           NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,144 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 281 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,145 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-04-28 21:21:40,162 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87.
[2025-04-28 21:21:40,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87 states, 40 states have (on average 1.25) internal successors, (50), 47 states have internal predecessors, (50), 17 states have call successors, (17), 10 states have call predecessors, (17), 29 states have return successors, (52), 29 states have call predecessors, (52), 17 states have call successors, (52)
[2025-04-28 21:21:40,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions.
[2025-04-28 21:21:40,164 INFO  L79                 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 33
[2025-04-28 21:21:40,164 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,164 INFO  L485      AbstractCegarLoop]: Abstraction has 87 states and 119 transitions.
[2025-04-28 21:21:40,164 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 3.4) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:40,164 INFO  L278                IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions.
[2025-04-28 21:21:40,166 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:40,167 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,167 INFO  L218           NwaCegarLoop]: trace histogram [2, 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:40,167 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:40,167 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,167 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -1844366485, now seen corresponding path program 1 times
[2025-04-28 21:21:40,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,168 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761912429]
[2025-04-28 21:21:40,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,178 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:40,181 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:40,181 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,181 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,339 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:40,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,339 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761912429]
[2025-04-28 21:21:40,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761912429] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,339 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363894005]
[2025-04-28 21:21:40,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,339 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,342 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,345 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:40,348 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:40,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:40,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,452 INFO  L256         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,454 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,511 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:40,512 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:42,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:42,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [363894005] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:42,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 13
[2025-04-28 21:21:42,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943216273]
[2025-04-28 21:21:42,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:42,132 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:42,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:42,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:42,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:42,133 INFO  L87              Difference]: Start difference. First operand 87 states and 119 transitions. Second operand  has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:42,253 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:42,253 INFO  L93              Difference]: Finished difference Result 91 states and 123 transitions.
[2025-04-28 21:21:42,254 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:42,254 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33
[2025-04-28 21:21:42,254 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:42,255 INFO  L225             Difference]: With dead ends: 91
[2025-04-28 21:21:42,255 INFO  L226             Difference]: Without dead ends: 91
[2025-04-28 21:21:42,256 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:42,256 INFO  L437           NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:42,256 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 285 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:42,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-04-28 21:21:42,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85.
[2025-04-28 21:21:42,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 46 states have internal predecessors, (49), 17 states have call successors, (17), 10 states have call predecessors, (17), 28 states have return successors, (50), 28 states have call predecessors, (50), 17 states have call successors, (50)
[2025-04-28 21:21:42,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions.
[2025-04-28 21:21:42,275 INFO  L79                 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 33
[2025-04-28 21:21:42,275 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:42,275 INFO  L485      AbstractCegarLoop]: Abstraction has 85 states and 116 transitions.
[2025-04-28 21:21:42,275 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:42,275 INFO  L278                IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions.
[2025-04-28 21:21:42,280 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:42,281 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:42,281 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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:42,288 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:42,481 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-04-28 21:21:42,481 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:42,482 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:42,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 267144504, now seen corresponding path program 2 times
[2025-04-28 21:21:42,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:42,482 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33408879]
[2025-04-28 21:21:42,482 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:42,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:42,489 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes.
[2025-04-28 21:21:42,494 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:42,494 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:42,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:42,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:42,690 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33408879]
[2025-04-28 21:21:42,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33408879] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,690 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937458314]
[2025-04-28 21:21:42,690 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:42,690 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:42,693 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:42,695 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:42,698 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:42,787 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes.
[2025-04-28 21:21:42,826 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:42,827 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:42,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,828 INFO  L256         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:42,831 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:42,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:42,899 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:45,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937458314] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,422 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18
[2025-04-28 21:21:45,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967559745]
[2025-04-28 21:21:45,423 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,423 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:45,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,424 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:45,424 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:45,424 INFO  L87              Difference]: Start difference. First operand 85 states and 116 transitions. Second operand  has 18 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 18 states have internal predecessors, (27), 11 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:45,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,679 INFO  L93              Difference]: Finished difference Result 93 states and 125 transitions.
[2025-04-28 21:21:45,679 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:45,679 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 18 states have internal predecessors, (27), 11 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15) Word has length 37
[2025-04-28 21:21:45,680 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,681 INFO  L225             Difference]: With dead ends: 93
[2025-04-28 21:21:45,681 INFO  L226             Difference]: Without dead ends: 93
[2025-04-28 21:21:45,681 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:45,682 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,682 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 518 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:45,683 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-04-28 21:21:45,693 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83.
[2025-04-28 21:21:45,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 38 states have (on average 1.263157894736842) internal successors, (48), 45 states have internal predecessors, (48), 17 states have call successors, (17), 10 states have call predecessors, (17), 27 states have return successors, (46), 27 states have call predecessors, (46), 17 states have call successors, (46)
[2025-04-28 21:21:45,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions.
[2025-04-28 21:21:45,694 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37
[2025-04-28 21:21:45,695 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,695 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 111 transitions.
[2025-04-28 21:21:45,695 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 18 states have internal predecessors, (27), 11 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:45,695 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions.
[2025-04-28 21:21:45,696 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:45,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,696 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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:45,704 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:21:45,896 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,897 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,897 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077145781, now seen corresponding path program 3 times
[2025-04-28 21:21:45,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,897 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550605980]
[2025-04-28 21:21:45,897 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:45,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,904 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes.
[2025-04-28 21:21:45,912 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:45,913 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:45,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:46,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:46,070 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550605980]
[2025-04-28 21:21:46,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550605980] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:46,070 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915388166]
[2025-04-28 21:21:46,070 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:46,071 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,073 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:46,075 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:46,078 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:46,186 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes.
[2025-04-28 21:21:46,219 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:46,219 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:46,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,220 INFO  L256         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:46,222 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:46,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:46,278 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:48,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:48,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915388166] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:48,338 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:48,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17
[2025-04-28 21:21:48,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510751988]
[2025-04-28 21:21:48,338 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:48,339 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:48,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:48,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:48,340 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:48,340 INFO  L87              Difference]: Start difference. First operand 83 states and 111 transitions. Second operand  has 17 states, 10 states have (on average 2.7) internal successors, (27), 17 states have internal predecessors, (27), 11 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:48,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,527 INFO  L93              Difference]: Finished difference Result 93 states and 124 transitions.
[2025-04-28 21:21:48,528 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:48,528 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 10 states have (on average 2.7) internal successors, (27), 17 states have internal predecessors, (27), 11 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) Word has length 37
[2025-04-28 21:21:48,528 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,529 INFO  L225             Difference]: With dead ends: 93
[2025-04-28 21:21:48,529 INFO  L226             Difference]: Without dead ends: 87
[2025-04-28 21:21:48,529 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:48,530 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,530 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 439 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:48,531 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2025-04-28 21:21:48,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85.
[2025-04-28 21:21:48,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 46 states have internal predecessors, (49), 17 states have call successors, (17), 10 states have call predecessors, (17), 28 states have return successors, (48), 28 states have call predecessors, (48), 17 states have call successors, (48)
[2025-04-28 21:21:48,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions.
[2025-04-28 21:21:48,548 INFO  L79                 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 37
[2025-04-28 21:21:48,548 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,548 INFO  L485      AbstractCegarLoop]: Abstraction has 85 states and 114 transitions.
[2025-04-28 21:21:48,548 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 10 states have (on average 2.7) internal successors, (27), 17 states have internal predecessors, (27), 11 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:48,548 INFO  L278                IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions.
[2025-04-28 21:21:48,549 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:48,549 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,549 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 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, 1]
[2025-04-28 21:21:48,560 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:48,750 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-04-28 21:21:48,750 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,750 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448552531, now seen corresponding path program 1 times
[2025-04-28 21:21:48,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,751 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902443208]
[2025-04-28 21:21:48,751 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,751 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,756 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-04-28 21:21:48,761 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:48,761 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,761 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:49,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,035 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902443208]
[2025-04-28 21:21:49,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902443208] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:49,036 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337383423]
[2025-04-28 21:21:49,036 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,036 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:49,038 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,040 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:49,044 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:49,176 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-04-28 21:21:49,202 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:49,202 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,202 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,204 INFO  L256         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:49,205 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:49,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:49,420 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:50,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:50,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337383423] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:50,525 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:50,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24
[2025-04-28 21:21:50,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411072924]
[2025-04-28 21:21:50,525 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,525 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:21:50,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:21:50,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:50,527 INFO  L87              Difference]: Start difference. First operand 85 states and 114 transitions. Second operand  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (12), 1 states have call predecessors, (12), 17 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20)
[2025-04-28 21:21:50,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,769 INFO  L93              Difference]: Finished difference Result 97 states and 127 transitions.
[2025-04-28 21:21:50,770 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:50,770 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (12), 1 states have call predecessors, (12), 17 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20) Word has length 37
[2025-04-28 21:21:50,770 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,771 INFO  L225             Difference]: With dead ends: 97
[2025-04-28 21:21:50,771 INFO  L226             Difference]: Without dead ends: 95
[2025-04-28 21:21:50,772 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:50,772 INFO  L437           NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,772 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 615 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:50,773 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2025-04-28 21:21:50,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89.
[2025-04-28 21:21:50,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 48 states have internal predecessors, (51), 17 states have call successors, (17), 10 states have call predecessors, (17), 30 states have return successors, (51), 30 states have call predecessors, (51), 17 states have call successors, (51)
[2025-04-28 21:21:50,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions.
[2025-04-28 21:21:50,789 INFO  L79                 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 37
[2025-04-28 21:21:50,789 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,789 INFO  L485      AbstractCegarLoop]: Abstraction has 89 states and 119 transitions.
[2025-04-28 21:21:50,789 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (12), 1 states have call predecessors, (12), 17 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20)
[2025-04-28 21:21:50,789 INFO  L278                IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions.
[2025-04-28 21:21:50,790 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:50,790 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,791 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 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, 1]
[2025-04-28 21:21:50,797 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:50,991 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-04-28 21:21:50,991 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,991 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -374814379, now seen corresponding path program 1 times
[2025-04-28 21:21:50,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,992 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292073212]
[2025-04-28 21:21:50,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,997 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-04-28 21:21:51,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:51,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,001 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:51,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,096 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292073212]
[2025-04-28 21:21:51,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292073212] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:51,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025568057]
[2025-04-28 21:21:51,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,097 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:51,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,098 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:51,098 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:51,098 INFO  L87              Difference]: Start difference. First operand 89 states and 119 transitions. Second operand  has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:51,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,185 INFO  L93              Difference]: Finished difference Result 88 states and 125 transitions.
[2025-04-28 21:21:51,186 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:51,186 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37
[2025-04-28 21:21:51,186 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,187 INFO  L225             Difference]: With dead ends: 88
[2025-04-28 21:21:51,187 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:51,187 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:51,188 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,188 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 242 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,190 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:51,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80.
[2025-04-28 21:21:51,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 43 states have internal predecessors, (47), 18 states have call successors, (18), 12 states have call predecessors, (18), 24 states have return successors, (40), 24 states have call predecessors, (40), 18 states have call successors, (40)
[2025-04-28 21:21:51,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions.
[2025-04-28 21:21:51,201 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 37
[2025-04-28 21:21:51,201 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,201 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 105 transitions.
[2025-04-28 21:21:51,201 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:51,201 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions.
[2025-04-28 21:21:51,202 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:21:51,202 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,202 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 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, 1]
[2025-04-28 21:21:51,202 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-04-28 21:21:51,202 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,203 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,203 INFO  L85        PathProgramCache]: Analyzing trace with hash 674942640, now seen corresponding path program 1 times
[2025-04-28 21:21:51,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,203 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62562702]
[2025-04-28 21:21:51,203 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-04-28 21:21:51,224 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:51,224 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,224 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:51,458 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,458 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62562702]
[2025-04-28 21:21:51,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62562702] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:51,458 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601826840]
[2025-04-28 21:21:51,458 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,458 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,461 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:51,463 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:51,467 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:51,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-04-28 21:21:51,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:21:51,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,643 INFO  L256         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:51,644 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:51,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:51,832 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:52,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:52,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601826840] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:52,967 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:52,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24
[2025-04-28 21:21:52,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183536083]
[2025-04-28 21:21:52,967 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,967 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:21:52,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,968 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:21:52,968 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:52,969 INFO  L87              Difference]: Start difference. First operand 80 states and 105 transitions. Second operand  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (12), 1 states have call predecessors, (12), 17 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20)
[2025-04-28 21:21:53,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,257 INFO  L93              Difference]: Finished difference Result 92 states and 119 transitions.
[2025-04-28 21:21:53,257 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:53,257 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (12), 1 states have call predecessors, (12), 17 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20) Word has length 37
[2025-04-28 21:21:53,258 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,261 INFO  L225             Difference]: With dead ends: 92
[2025-04-28 21:21:53,261 INFO  L226             Difference]: Without dead ends: 88
[2025-04-28 21:21:53,261 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:53,262 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,262 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 860 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:53,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-04-28 21:21:53,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86.
[2025-04-28 21:21:53,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 40 states have (on average 1.25) internal successors, (50), 46 states have internal predecessors, (50), 18 states have call successors, (18), 12 states have call predecessors, (18), 27 states have return successors, (45), 27 states have call predecessors, (45), 18 states have call successors, (45)
[2025-04-28 21:21:53,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions.
[2025-04-28 21:21:53,274 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 37
[2025-04-28 21:21:53,275 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,275 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 113 transitions.
[2025-04-28 21:21:53,275 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 7 states have call successors, (12), 1 states have call predecessors, (12), 17 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20)
[2025-04-28 21:21:53,275 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions.
[2025-04-28 21:21:53,276 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:53,276 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,276 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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:53,282 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:53,476 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-04-28 21:21:53,477 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,477 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -547856454, now seen corresponding path program 4 times
[2025-04-28 21:21:53,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,478 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587284792]
[2025-04-28 21:21:53,478 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:53,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,484 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes.
[2025-04-28 21:21:53,490 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:53,490 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:53,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:53,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587284792]
[2025-04-28 21:21:53,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587284792] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:53,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301900169]
[2025-04-28 21:21:53,771 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:53,771 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,773 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,776 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:53,779 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,929 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes.
[2025-04-28 21:21:53,959 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:53,959 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:53,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,962 INFO  L256         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 49 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,964 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:54,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:54,240 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:55,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:55,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301900169] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:55,717 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:55,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 28
[2025-04-28 21:21:55,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720936267]
[2025-04-28 21:21:55,717 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,718 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-04-28 21:21:55,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-04-28 21:21:55,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:55,719 INFO  L87              Difference]: Start difference. First operand 86 states and 113 transitions. Second operand  has 28 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (13), 1 states have call predecessors, (13), 19 states have return successors, (24), 17 states have call predecessors, (24), 9 states have call successors, (24)
[2025-04-28 21:21:56,015 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:56,015 INFO  L93              Difference]: Finished difference Result 102 states and 133 transitions.
[2025-04-28 21:21:56,015 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:56,016 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (13), 1 states have call predecessors, (13), 19 states have return successors, (24), 17 states have call predecessors, (24), 9 states have call successors, (24) Word has length 41
[2025-04-28 21:21:56,016 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:56,017 INFO  L225             Difference]: With dead ends: 102
[2025-04-28 21:21:56,017 INFO  L226             Difference]: Without dead ends: 100
[2025-04-28 21:21:56,017 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992
[2025-04-28 21:21:56,018 INFO  L437           NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:56,018 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 729 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:56,019 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-04-28 21:21:56,024 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94.
[2025-04-28 21:21:56,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 18 states have call successors, (18), 12 states have call predecessors, (18), 31 states have return successors, (53), 31 states have call predecessors, (53), 18 states have call successors, (53)
[2025-04-28 21:21:56,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions.
[2025-04-28 21:21:56,026 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 41
[2025-04-28 21:21:56,026 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:56,026 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 125 transitions.
[2025-04-28 21:21:56,026 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 20 states have (on average 1.7) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (13), 1 states have call predecessors, (13), 19 states have return successors, (24), 17 states have call predecessors, (24), 9 states have call successors, (24)
[2025-04-28 21:21:56,027 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions.
[2025-04-28 21:21:56,028 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:56,029 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:56,029 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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:56,033 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:56,233 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-04-28 21:21:56,233 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:56,233 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:56,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 670533077, now seen corresponding path program 2 times
[2025-04-28 21:21:56,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:56,234 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899117833]
[2025-04-28 21:21:56,234 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:56,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:56,254 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes.
[2025-04-28 21:21:56,266 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:56,270 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:56,270 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:56,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:56,449 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899117833]
[2025-04-28 21:21:56,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899117833] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:56,449 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784120191]
[2025-04-28 21:21:56,449 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:56,449 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:56,452 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:56,454 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:56,460 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:56,617 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes.
[2025-04-28 21:21:56,644 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:56,645 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:56,645 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,646 INFO  L256         TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:56,647 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:56,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:56,707 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:59,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:59,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [784120191] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:59,456 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:59,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18
[2025-04-28 21:21:59,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446658949]
[2025-04-28 21:21:59,456 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:59,457 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:59,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:59,457 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:59,458 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:59,458 INFO  L87              Difference]: Start difference. First operand 94 states and 125 transitions. Second operand  has 18 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 18 states have internal predecessors, (29), 11 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:59,729 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:59,729 INFO  L93              Difference]: Finished difference Result 108 states and 140 transitions.
[2025-04-28 21:21:59,730 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:59,730 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 18 states have internal predecessors, (29), 11 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) Word has length 41
[2025-04-28 21:21:59,731 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:59,731 INFO  L225             Difference]: With dead ends: 108
[2025-04-28 21:21:59,732 INFO  L226             Difference]: Without dead ends: 108
[2025-04-28 21:21:59,732 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:59,733 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:59,733 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 457 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:59,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2025-04-28 21:21:59,739 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102.
[2025-04-28 21:21:59,739 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 54 states have internal predecessors, (58), 18 states have call successors, (18), 12 states have call predecessors, (18), 35 states have return successors, (58), 35 states have call predecessors, (58), 18 states have call successors, (58)
[2025-04-28 21:21:59,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions.
[2025-04-28 21:21:59,741 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 41
[2025-04-28 21:21:59,741 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:59,741 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 134 transitions.
[2025-04-28 21:21:59,741 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 18 states have internal predecessors, (29), 11 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:59,741 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions.
[2025-04-28 21:21:59,742 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:59,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:59,743 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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:59,749 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:59,943 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-04-28 21:21:59,943 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,943 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1142733653, now seen corresponding path program 3 times
[2025-04-28 21:21:59,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,944 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194041798]
[2025-04-28 21:21:59,944 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:59,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,950 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes.
[2025-04-28 21:21:59,955 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:59,956 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:59,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:00,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:00,080 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194041798]
[2025-04-28 21:22:00,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194041798] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:00,080 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913886692]
[2025-04-28 21:22:00,080 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:00,080 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:00,082 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:00,084 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:22:00,087 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:22:00,277 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes.
[2025-04-28 21:22:00,306 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:22:00,306 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:22:00,306 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,307 INFO  L256         TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:00,308 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:00,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:00,351 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
