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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:16,456 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:16,520 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314de393-761d-468b-9e2a-6708600ab202/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:16,525 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:16,525 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:16,555 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:16,557 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:16,557 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:16,559 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:16,559 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:16,560 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:16,561 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:16,561 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:16,561 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:16,561 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:16,561 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:16,562 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:16,562 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:16,562 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:16,562 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:16,562 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:16,562 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:16,562 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:16,563 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:16,563 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:16,564 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:16,564 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:16,923 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:16,934 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:16,937 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:16,940 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:16,941 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:16,942 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314de393-761d-468b-9e2a-6708600ab202/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-165.smt2
[2025-04-28 21:21:16,945 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:16,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:17,275 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314de393-761d-468b-9e2a-6708600ab202/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-165.smt2
[2025-04-28 21:21:17,278 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:17,280 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:17,280 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:17,281 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:17,281 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:17,283 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,324 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17 Unit
[2025-04-28 21:21:17,325 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:17,326 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:17,327 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:17,327 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:17,342 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,342 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,365 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,366 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,369 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,370 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,373 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,374 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,375 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,391 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:17,395 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:17,395 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:17,396 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:17,397 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,400 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:17,415 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:17,433 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:17,437 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:17,449 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:17,449 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:17,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:17,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:17,450 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:17,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:17,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration
[2025-04-28 21:21:17,450 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1
[2025-04-28 21:21:17,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1
[2025-04-28 21:21:17,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration
[2025-04-28 21:21:17,450 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:17,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:17,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration
[2025-04-28 21:21:17,450 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2
[2025-04-28 21:21:17,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2
[2025-04-28 21:21:17,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration
[2025-04-28 21:21:17,451 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:17,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:17,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_42_PRE given in one single declaration
[2025-04-28 21:21:17,451 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_42_PRE
[2025-04-28 21:21:17,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_42_PRE
[2025-04-28 21:21:17,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration
[2025-04-28 21:21:17,451 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:17,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:17,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f given in one single declaration
[2025-04-28 21:21:17,451 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f
[2025-04-28 21:21:17,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f
[2025-04-28 21:21:17,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_42 given in one single declaration
[2025-04-28 21:21:17,452 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_42
[2025-04-28 21:21:17,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_42
[2025-04-28 21:21:17,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration
[2025-04-28 21:21:17,452 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_42
[2025-04-28 21:21:17,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_42
[2025-04-28 21:21:17,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:17,452 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:17,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:17,507 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:17,509 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:17,848 INFO  L?                        ?]: Removed 2 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:17,848 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:17,864 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:17,865 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:17,865 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:17 BoogieIcfgContainer
[2025-04-28 21:21:17,865 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:17,868 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:17,868 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:17,873 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:17,873 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:17" (1/3) ...
[2025-04-28 21:21:17,874 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2265eb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:17, skipping insertion in model container
[2025-04-28 21:21:17,874 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (2/3) ...
[2025-04-28 21:21:17,875 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2265eb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:17, skipping insertion in model container
[2025-04-28 21:21:17,875 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:17" (3/3) ...
[2025-04-28 21:21:17,876 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:17,898 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:17,902 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 12 procedures, 68 locations, 135 edges, 12 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:17,961 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:17,974 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;@16825a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:17,974 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:17,979 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 68 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 38 states have internal predecessors, (39), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (32), 20 states have call predecessors, (32), 32 states have call successors, (32)
[2025-04-28 21:21:17,989 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2025-04-28 21:21:17,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:17,990 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:17,991 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:17,996 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:17,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 1441087686, now seen corresponding path program 1 times
[2025-04-28 21:21:18,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,004 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158671393]
[2025-04-28 21:21:18,004 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,030 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-04-28 21:21:18,033 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-04-28 21:21:18,033 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:18,033 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:18,066 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:18,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:18,067 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158671393]
[2025-04-28 21:21:18,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158671393] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:18,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:18,071 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-04-28 21:21:18,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832928740]
[2025-04-28 21:21:18,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,079 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-04-28 21:21:18,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-04-28 21:21:18,108 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:18,111 INFO  L87              Difference]: Start difference. First operand  has 68 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 38 states have internal predecessors, (39), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (32), 20 states have call predecessors, (32), 32 states have call successors, (32) Second operand  has 2 states, 2 states have (on average 2.0) internal successors, (4), 1 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-04-28 21:21:18,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:18,145 INFO  L93              Difference]: Finished difference Result 66 states and 99 transitions.
[2025-04-28 21:21:18,146 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-04-28 21:21:18,149 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 2.0) internal successors, (4), 1 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 8
[2025-04-28 21:21:18,150 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:18,160 INFO  L225             Difference]: With dead ends: 66
[2025-04-28 21:21:18,161 INFO  L226             Difference]: Without dead ends: 66
[2025-04-28 21:21:18,163 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:18,166 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:18,167 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:18,184 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2025-04-28 21:21:18,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66.
[2025-04-28 21:21:18,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 35 states have internal predecessors, (35), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (32), 20 states have call predecessors, (32), 32 states have call successors, (32)
[2025-04-28 21:21:18,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions.
[2025-04-28 21:21:18,228 INFO  L79                 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 8
[2025-04-28 21:21:18,230 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:18,230 INFO  L485      AbstractCegarLoop]: Abstraction has 66 states and 99 transitions.
[2025-04-28 21:21:18,231 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 2.0) internal successors, (4), 1 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-04-28 21:21:18,232 INFO  L278                IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions.
[2025-04-28 21:21:18,237 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:18,240 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:18,240 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:18,240 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:18,241 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:18,241 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:18,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 45999656, now seen corresponding path program 1 times
[2025-04-28 21:21:18,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,242 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993741209]
[2025-04-28 21:21:18,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:18,291 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:18,291 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:18,291 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:18,446 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:18,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:18,446 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993741209]
[2025-04-28 21:21:18,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993741209] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:18,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:18,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:18,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213131914]
[2025-04-28 21:21:18,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,478 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:18,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:18,485 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:18,485 INFO  L87              Difference]: Start difference. First operand 66 states and 99 transitions. Second operand  has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:18,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:18,694 INFO  L93              Difference]: Finished difference Result 72 states and 114 transitions.
[2025-04-28 21:21:18,695 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:18,695 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:21:18,695 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:18,697 INFO  L225             Difference]: With dead ends: 72
[2025-04-28 21:21:18,697 INFO  L226             Difference]: Without dead ends: 72
[2025-04-28 21:21:18,698 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:18,699 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:18,699 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 329 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:18,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-04-28 21:21:18,721 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70.
[2025-04-28 21:21:18,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 37 states have internal predecessors, (37), 32 states have call successors, (32), 11 states have call predecessors, (32), 13 states have return successors, (43), 21 states have call predecessors, (43), 32 states have call successors, (43)
[2025-04-28 21:21:18,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 112 transitions.
[2025-04-28 21:21:18,725 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 112 transitions. Word has length 16
[2025-04-28 21:21:18,725 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:18,725 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 112 transitions.
[2025-04-28 21:21:18,726 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:18,726 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 112 transitions.
[2025-04-28 21:21:18,730 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:18,732 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:18,733 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:18,733 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:18,733 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:18,734 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:18,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -2049685465, now seen corresponding path program 1 times
[2025-04-28 21:21:18,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,734 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310583148]
[2025-04-28 21:21:18,734 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:18,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:18,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:18,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:18,918 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:18,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:18,918 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310583148]
[2025-04-28 21:21:18,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310583148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:18,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:18,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:18,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551775165]
[2025-04-28 21:21:18,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,919 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:18,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,921 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:18,921 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:18,921 INFO  L87              Difference]: Start difference. First operand 70 states and 112 transitions. Second operand  has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:19,108 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:19,108 INFO  L93              Difference]: Finished difference Result 72 states and 113 transitions.
[2025-04-28 21:21:19,109 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:19,110 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:21:19,110 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:19,112 INFO  L225             Difference]: With dead ends: 72
[2025-04-28 21:21:19,115 INFO  L226             Difference]: Without dead ends: 72
[2025-04-28 21:21:19,115 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:19,116 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:19,118 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 339 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:19,120 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-04-28 21:21:19,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70.
[2025-04-28 21:21:19,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 37 states have internal predecessors, (37), 32 states have call successors, (32), 11 states have call predecessors, (32), 13 states have return successors, (42), 21 states have call predecessors, (42), 32 states have call successors, (42)
[2025-04-28 21:21:19,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 111 transitions.
[2025-04-28 21:21:19,144 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 111 transitions. Word has length 16
[2025-04-28 21:21:19,145 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:19,145 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 111 transitions.
[2025-04-28 21:21:19,145 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:19,145 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 111 transitions.
[2025-04-28 21:21:19,148 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:19,152 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:19,152 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:19,152 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:19,152 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:19,153 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:19,153 INFO  L85        PathProgramCache]: Analyzing trace with hash -2077184404, now seen corresponding path program 1 times
[2025-04-28 21:21:19,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:19,153 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928068555]
[2025-04-28 21:21:19,153 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:19,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:19,163 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:19,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:19,187 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:19,187 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,469 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:19,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:19,469 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928068555]
[2025-04-28 21:21:19,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928068555] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:19,469 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292467410]
[2025-04-28 21:21:19,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:19,470 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:19,473 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:19,478 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:19,480 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:19,534 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:19,554 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:19,554 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:19,554 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,556 INFO  L256         TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:19,562 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:19,691 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:19,692 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:19,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [292467410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:19,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:19,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10
[2025-04-28 21:21:19,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989161027]
[2025-04-28 21:21:19,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:19,693 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:19,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:19,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:19,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:19,694 INFO  L87              Difference]: Start difference. First operand 70 states and 111 transitions. Second operand  has 7 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:19,947 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:19,947 INFO  L93              Difference]: Finished difference Result 74 states and 118 transitions.
[2025-04-28 21:21:19,947 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:19,948 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:19,948 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:19,952 INFO  L225             Difference]: With dead ends: 74
[2025-04-28 21:21:19,952 INFO  L226             Difference]: Without dead ends: 74
[2025-04-28 21:21:19,952 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:19,953 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:19,957 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 436 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:19,958 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2025-04-28 21:21:19,967 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72.
[2025-04-28 21:21:19,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72 states, 25 states have (on average 1.52) internal successors, (38), 38 states have internal predecessors, (38), 32 states have call successors, (32), 11 states have call predecessors, (32), 14 states have return successors, (46), 22 states have call predecessors, (46), 32 states have call successors, (46)
[2025-04-28 21:21:19,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions.
[2025-04-28 21:21:19,970 INFO  L79                 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 20
[2025-04-28 21:21:19,970 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:19,970 INFO  L485      AbstractCegarLoop]: Abstraction has 72 states and 116 transitions.
[2025-04-28 21:21:19,970 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:19,970 INFO  L278                IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions.
[2025-04-28 21:21:19,972 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:19,972 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:19,972 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:19,978 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:20,176 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:20,176 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:20,177 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:20,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 894980075, now seen corresponding path program 1 times
[2025-04-28 21:21:20,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:20,177 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288617940]
[2025-04-28 21:21:20,177 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:20,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:20,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:20,197 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:20,197 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:20,197 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:20,368 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:20,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:20,368 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288617940]
[2025-04-28 21:21:20,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288617940] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:20,368 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449515817]
[2025-04-28 21:21:20,368 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:20,368 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:20,373 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:20,376 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:20,379 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:20,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:20,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:20,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:20,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:20,442 INFO  L256         TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:20,443 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:20,514 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:20,514 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:20,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449515817] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:20,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:20,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10
[2025-04-28 21:21:20,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573415176]
[2025-04-28 21:21:20,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:20,515 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:20,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:20,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:20,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:20,516 INFO  L87              Difference]: Start difference. First operand 72 states and 116 transitions. Second operand  has 7 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:20,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:20,705 INFO  L93              Difference]: Finished difference Result 74 states and 117 transitions.
[2025-04-28 21:21:20,705 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:20,706 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:20,706 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:20,708 INFO  L225             Difference]: With dead ends: 74
[2025-04-28 21:21:20,709 INFO  L226             Difference]: Without dead ends: 74
[2025-04-28 21:21:20,710 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:20,711 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:20,713 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 440 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:20,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2025-04-28 21:21:20,729 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68.
[2025-04-28 21:21:20,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 23 states have (on average 1.565217391304348) internal successors, (36), 36 states have internal predecessors, (36), 32 states have call successors, (32), 11 states have call predecessors, (32), 12 states have return successors, (35), 21 states have call predecessors, (35), 32 states have call successors, (35)
[2025-04-28 21:21:20,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions.
[2025-04-28 21:21:20,731 INFO  L79                 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 20
[2025-04-28 21:21:20,731 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:20,731 INFO  L485      AbstractCegarLoop]: Abstraction has 68 states and 103 transitions.
[2025-04-28 21:21:20,731 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.0) internal successors, (10), 7 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:20,731 INFO  L278                IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions.
[2025-04-28 21:21:20,734 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:20,734 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:20,734 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]
[2025-04-28 21:21:20,742 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:20,935 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:20,935 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:20,935 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:20,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 1426791852, now seen corresponding path program 1 times
[2025-04-28 21:21:20,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:20,936 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573914995]
[2025-04-28 21:21:20,936 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:20,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:20,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:20,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:20,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:20,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,050 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:21,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:21,050 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573914995]
[2025-04-28 21:21:21,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573914995] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:21,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:21,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:21,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442508107]
[2025-04-28 21:21:21,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,051 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:21,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,051 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:21,051 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:21,052 INFO  L87              Difference]: Start difference. First operand 68 states and 103 transitions. Second operand  has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:21,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:21,194 INFO  L93              Difference]: Finished difference Result 74 states and 119 transitions.
[2025-04-28 21:21:21,195 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:21,195 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:21,195 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:21,197 INFO  L225             Difference]: With dead ends: 74
[2025-04-28 21:21:21,197 INFO  L226             Difference]: Without dead ends: 74
[2025-04-28 21:21:21,197 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:21,198 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:21,198 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 345 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:21,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2025-04-28 21:21:21,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72.
[2025-04-28 21:21:21,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72 states, 25 states have (on average 1.52) internal successors, (38), 38 states have internal predecessors, (38), 32 states have call successors, (32), 11 states have call predecessors, (32), 14 states have return successors, (47), 23 states have call predecessors, (47), 32 states have call successors, (47)
[2025-04-28 21:21:21,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions.
[2025-04-28 21:21:21,220 INFO  L79                 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 24
[2025-04-28 21:21:21,220 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:21,220 INFO  L485      AbstractCegarLoop]: Abstraction has 72 states and 117 transitions.
[2025-04-28 21:21:21,220 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:21,220 INFO  L278                IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions.
[2025-04-28 21:21:21,221 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:21,221 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:21,222 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]
[2025-04-28 21:21:21,225 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:21,225 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:21,226 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:21,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 1117273771, now seen corresponding path program 1 times
[2025-04-28 21:21:21,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:21,226 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421345022]
[2025-04-28 21:21:21,226 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:21,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:21,231 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:21,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:21,238 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:21,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,291 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:21,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:21,291 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421345022]
[2025-04-28 21:21:21,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421345022] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:21,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:21,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:21,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802347439]
[2025-04-28 21:21:21,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,292 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:21,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:21,293 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:21,293 INFO  L87              Difference]: Start difference. First operand 72 states and 117 transitions. Second operand  has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:21,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:21,403 INFO  L93              Difference]: Finished difference Result 74 states and 118 transitions.
[2025-04-28 21:21:21,404 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:21,404 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:21,404 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:21,405 INFO  L225             Difference]: With dead ends: 74
[2025-04-28 21:21:21,405 INFO  L226             Difference]: Without dead ends: 74
[2025-04-28 21:21:21,406 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:21,407 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:21,407 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 348 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:21,408 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2025-04-28 21:21:21,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70.
[2025-04-28 21:21:21,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 37 states have internal predecessors, (37), 32 states have call successors, (32), 11 states have call predecessors, (32), 13 states have return successors, (43), 22 states have call predecessors, (43), 32 states have call successors, (43)
[2025-04-28 21:21:21,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 112 transitions.
[2025-04-28 21:21:21,420 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 112 transitions. Word has length 24
[2025-04-28 21:21:21,421 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:21,421 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 112 transitions.
[2025-04-28 21:21:21,421 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:21,421 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 112 transitions.
[2025-04-28 21:21:21,422 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:21,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:21,422 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]
[2025-04-28 21:21:21,423 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:21,425 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:21,425 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:21,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -1820457080, now seen corresponding path program 1 times
[2025-04-28 21:21:21,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:21,426 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811992242]
[2025-04-28 21:21:21,426 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:21,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:21,438 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:21,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:21,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:21,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,621 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:21,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:21,633 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811992242]
[2025-04-28 21:21:21,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811992242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:21,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:21,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:21,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449261725]
[2025-04-28 21:21:21,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,634 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:21,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,634 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:21,635 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:21,635 INFO  L87              Difference]: Start difference. First operand 70 states and 112 transitions. Second operand  has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:21,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:21,819 INFO  L93              Difference]: Finished difference Result 80 states and 131 transitions.
[2025-04-28 21:21:21,820 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:21,820 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:21,820 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:21,821 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:21,821 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:21,822 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:21,822 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:21,823 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 494 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:21,823 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:21,831 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76.
[2025-04-28 21:21:21,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 40 states have internal predecessors, (40), 32 states have call successors, (32), 11 states have call predecessors, (32), 16 states have return successors, (54), 24 states have call predecessors, (54), 32 states have call successors, (54)
[2025-04-28 21:21:21,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 126 transitions.
[2025-04-28 21:21:21,833 INFO  L79                 Accepts]: Start accepts. Automaton has 76 states and 126 transitions. Word has length 24
[2025-04-28 21:21:21,834 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:21,834 INFO  L485      AbstractCegarLoop]: Abstraction has 76 states and 126 transitions.
[2025-04-28 21:21:21,834 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:21,834 INFO  L278                IsEmpty]: Start isEmpty. Operand 76 states and 126 transitions.
[2025-04-28 21:21:21,835 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:21,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:21,835 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:21,836 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:21,836 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:21,836 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:21,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -1971827508, now seen corresponding path program 1 times
[2025-04-28 21:21:21,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:21,836 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774482111]
[2025-04-28 21:21:21,837 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:21,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:21,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:21,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:21,848 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:21,848 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:22,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,022 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774482111]
[2025-04-28 21:21:22,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774482111] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:22,023 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462144752]
[2025-04-28 21:21:22,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,023 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,027 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:22,029 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:22,034 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:22,095 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:22,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:22,122 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,122 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,123 INFO  L256         TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:22,124 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:22,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:22,210 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:22,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462144752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:22,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:22,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11
[2025-04-28 21:21:22,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045126121]
[2025-04-28 21:21:22,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:22,211 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:22,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:22,212 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:22,212 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:22,212 INFO  L87              Difference]: Start difference. First operand 76 states and 126 transitions. Second operand  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:22,387 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:22,387 INFO  L93              Difference]: Finished difference Result 80 states and 132 transitions.
[2025-04-28 21:21:22,387 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:22,388 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 28
[2025-04-28 21:21:22,388 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:22,389 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:22,389 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:22,389 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:22,390 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:22,390 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 420 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:22,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:22,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78.
[2025-04-28 21:21:22,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 41 states have internal predecessors, (41), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (56), 25 states have call predecessors, (56), 32 states have call successors, (56)
[2025-04-28 21:21:22,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 129 transitions.
[2025-04-28 21:21:22,407 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 129 transitions. Word has length 28
[2025-04-28 21:21:22,407 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:22,407 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 129 transitions.
[2025-04-28 21:21:22,407 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:22,407 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 129 transitions.
[2025-04-28 21:21:22,413 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:22,413 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:22,413 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]
[2025-04-28 21:21:22,419 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:22,613 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,614 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:22,614 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:22,614 INFO  L85        PathProgramCache]: Analyzing trace with hash -1093349474, now seen corresponding path program 1 times
[2025-04-28 21:21:22,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:22,614 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351155437]
[2025-04-28 21:21:22,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:22,620 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:22,626 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:22,626 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,626 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,676 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:22,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,676 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351155437]
[2025-04-28 21:21:22,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351155437] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:22,677 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632874009]
[2025-04-28 21:21:22,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,677 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,680 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:22,682 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:22,685 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:22,718 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:22,737 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:22,737 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,737 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,738 INFO  L256         TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:22,739 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:22,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:22,760 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:22,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [632874009] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:22,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:22,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5
[2025-04-28 21:21:22,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201949684]
[2025-04-28 21:21:22,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:22,761 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:22,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:22,761 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:22,762 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:22,762 INFO  L87              Difference]: Start difference. First operand 78 states and 129 transitions. Second operand  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:22,882 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:22,882 INFO  L93              Difference]: Finished difference Result 78 states and 128 transitions.
[2025-04-28 21:21:22,883 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:22,883 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32
[2025-04-28 21:21:22,883 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:22,884 INFO  L225             Difference]: With dead ends: 78
[2025-04-28 21:21:22,884 INFO  L226             Difference]: Without dead ends: 78
[2025-04-28 21:21:22,884 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 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:22,885 INFO  L437           NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:22,885 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 305 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:22,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2025-04-28 21:21:22,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2025-04-28 21:21:22,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 41 states have internal predecessors, (41), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (55), 25 states have call predecessors, (55), 32 states have call successors, (55)
[2025-04-28 21:21:22,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 128 transitions.
[2025-04-28 21:21:22,901 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 128 transitions. Word has length 32
[2025-04-28 21:21:22,901 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:22,901 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 128 transitions.
[2025-04-28 21:21:22,902 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:22,902 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 128 transitions.
[2025-04-28 21:21:22,903 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:22,903 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:22,903 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]
[2025-04-28 21:21:22,910 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:23,103 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:23,104 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,104 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 2011880705, now seen corresponding path program 1 times
[2025-04-28 21:21:23,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,104 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7942921]
[2025-04-28 21:21:23,104 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,108 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:23,112 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:23,112 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,210 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:23,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:23,211 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7942921]
[2025-04-28 21:21:23,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7942921] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:23,211 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809492614]
[2025-04-28 21:21:23,211 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:23,214 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:23,216 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:23,219 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:23,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:23,276 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:23,276 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,277 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,277 INFO  L256         TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:23,279 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:23,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:23,358 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:23,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [809492614] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:23,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:23,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:23,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428592703]
[2025-04-28 21:21:23,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,359 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:23,359 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,359 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:23,360 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:23,360 INFO  L87              Difference]: Start difference. First operand 78 states and 128 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:23,424 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,424 INFO  L93              Difference]: Finished difference Result 80 states and 129 transitions.
[2025-04-28 21:21:23,425 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:23,425 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:23,425 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,426 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:23,426 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:23,426 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:23,427 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,427 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 264 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:23,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:23,459 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78.
[2025-04-28 21:21:23,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 41 states have internal predecessors, (41), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (54), 25 states have call predecessors, (54), 32 states have call successors, (54)
[2025-04-28 21:21:23,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 127 transitions.
[2025-04-28 21:21:23,462 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 127 transitions. Word has length 24
[2025-04-28 21:21:23,463 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,463 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 127 transitions.
[2025-04-28 21:21:23,463 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:23,465 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 127 transitions.
[2025-04-28 21:21:23,466 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:23,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,467 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]
[2025-04-28 21:21:23,473 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:23,667 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:23,668 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,668 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -1354411828, now seen corresponding path program 1 times
[2025-04-28 21:21:23,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,671 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367293075]
[2025-04-28 21:21:23,671 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:23,678 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:23,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,728 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:23,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:23,729 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367293075]
[2025-04-28 21:21:23,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367293075] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:23,729 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60481995]
[2025-04-28 21:21:23,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,729 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:23,732 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:23,734 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:23,742 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:23,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:23,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:23,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,791 INFO  L256         TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:23,792 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:23,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:23,864 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:23,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [60481995] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:23,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:23,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:23,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251310838]
[2025-04-28 21:21:23,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,865 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:23,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:23,865 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:23,866 INFO  L87              Difference]: Start difference. First operand 78 states and 127 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:23,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,924 INFO  L93              Difference]: Finished difference Result 80 states and 128 transitions.
[2025-04-28 21:21:23,925 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:23,925 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:23,925 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,926 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:23,926 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:23,927 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:23,927 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,928 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:23,928 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:23,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78.
[2025-04-28 21:21:23,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 41 states have internal predecessors, (41), 32 states have call successors, (32), 11 states have call predecessors, (32), 17 states have return successors, (53), 25 states have call predecessors, (53), 32 states have call successors, (53)
[2025-04-28 21:21:23,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions.
[2025-04-28 21:21:23,936 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 24
[2025-04-28 21:21:23,936 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,936 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 126 transitions.
[2025-04-28 21:21:23,936 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:23,936 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions.
[2025-04-28 21:21:23,937 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:23,938 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,938 INFO  L218           NwaCegarLoop]: trace histogram [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:23,943 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:24,142 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:24,142 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,143 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 2032664821, now seen corresponding path program 1 times
[2025-04-28 21:21:24,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,143 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719048794]
[2025-04-28 21:21:24,143 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,147 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:24,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:24,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:24,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:24,323 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719048794]
[2025-04-28 21:21:24,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719048794] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:24,323 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933515297]
[2025-04-28 21:21:24,323 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,323 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:24,325 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:24,328 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:24,330 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:24,367 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:24,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:24,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,396 INFO  L256         TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:24,401 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:24,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:24,522 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:24,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [933515297] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:24,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:24,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16
[2025-04-28 21:21:24,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248471145]
[2025-04-28 21:21:24,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:24,522 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:24,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:24,523 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:24,523 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:24,523 INFO  L87              Difference]: Start difference. First operand 78 states and 126 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, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:24,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:24,691 INFO  L93              Difference]: Finished difference Result 80 states and 127 transitions.
[2025-04-28 21:21:24,692 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:24,692 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, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 32
[2025-04-28 21:21:24,693 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:24,694 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:24,694 INFO  L226             Difference]: Without dead ends: 79
[2025-04-28 21:21:24,694 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:24,695 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:24,695 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:24,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2025-04-28 21:21:24,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77.
[2025-04-28 21:21:24,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 40 states have internal predecessors, (40), 31 states have call successors, (31), 11 states have call predecessors, (31), 17 states have return successors, (52), 25 states have call predecessors, (52), 31 states have call successors, (52)
[2025-04-28 21:21:24,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions.
[2025-04-28 21:21:24,704 INFO  L79                 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 32
[2025-04-28 21:21:24,704 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:24,704 INFO  L485      AbstractCegarLoop]: Abstraction has 77 states and 123 transitions.
[2025-04-28 21:21:24,704 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, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:24,704 INFO  L278                IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions.
[2025-04-28 21:21:24,705 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:24,705 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:24,706 INFO  L218           NwaCegarLoop]: trace histogram [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:24,711 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:24,910 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:24,910 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,911 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,911 INFO  L85        PathProgramCache]: Analyzing trace with hash 167567604, now seen corresponding path program 1 times
[2025-04-28 21:21:24,911 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,911 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948790225]
[2025-04-28 21:21:24,911 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:24,923 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:24,923 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,923 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:25,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,079 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948790225]
[2025-04-28 21:21:25,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948790225] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:25,080 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184335612]
[2025-04-28 21:21:25,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,080 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:25,082 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:25,085 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:25,089 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:25,126 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:25,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:25,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,151 INFO  L256         TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:25,153 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:25,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:25,287 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:25,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [184335612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:25,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:25,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16
[2025-04-28 21:21:25,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778169011]
[2025-04-28 21:21:25,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,288 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:25,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:25,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:25,289 INFO  L87              Difference]: Start difference. First operand 77 states and 123 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, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:25,472 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,472 INFO  L93              Difference]: Finished difference Result 77 states and 122 transitions.
[2025-04-28 21:21:25,472 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:25,472 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, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 32
[2025-04-28 21:21:25,473 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,474 INFO  L225             Difference]: With dead ends: 77
[2025-04-28 21:21:25,474 INFO  L226             Difference]: Without dead ends: 76
[2025-04-28 21:21:25,474 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:25,474 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:25,475 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 406 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:25,475 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2025-04-28 21:21:25,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72.
[2025-04-28 21:21:25,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 37 states have internal predecessors, (37), 30 states have call successors, (30), 11 states have call predecessors, (30), 15 states have return successors, (40), 23 states have call predecessors, (40), 30 states have call successors, (40)
[2025-04-28 21:21:25,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions.
[2025-04-28 21:21:25,486 INFO  L79                 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 32
[2025-04-28 21:21:25,486 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:25,486 INFO  L485      AbstractCegarLoop]: Abstraction has 72 states and 107 transitions.
[2025-04-28 21:21:25,486 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, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:25,486 INFO  L278                IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions.
[2025-04-28 21:21:25,489 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:25,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,489 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:25,494 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:25,689 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-04-28 21:21:25,690 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,690 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,690 INFO  L85        PathProgramCache]: Analyzing trace with hash -476156336, now seen corresponding path program 1 times
[2025-04-28 21:21:25,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,690 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424303624]
[2025-04-28 21:21:25,690 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:25,699 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:25,699 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:25,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,783 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424303624]
[2025-04-28 21:21:25,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424303624] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:25,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:25,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:25,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555815781]
[2025-04-28 21:21:25,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,783 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:25,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,784 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:25,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:25,784 INFO  L87              Difference]: Start difference. First operand 72 states and 107 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, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9)
[2025-04-28 21:21:25,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,929 INFO  L93              Difference]: Finished difference Result 82 states and 127 transitions.
[2025-04-28 21:21:25,929 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:25,930 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, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 36
[2025-04-28 21:21:25,930 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,931 INFO  L225             Difference]: With dead ends: 82
[2025-04-28 21:21:25,931 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:25,931 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:25,932 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:25,932 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 474 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:25,933 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:25,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76.
[2025-04-28 21:21:25,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 39 states have internal predecessors, (39), 30 states have call successors, (30), 11 states have call predecessors, (30), 17 states have return successors, (51), 25 states have call predecessors, (51), 30 states have call successors, (51)
[2025-04-28 21:21:25,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 120 transitions.
[2025-04-28 21:21:25,941 INFO  L79                 Accepts]: Start accepts. Automaton has 76 states and 120 transitions. Word has length 36
[2025-04-28 21:21:25,942 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:25,942 INFO  L485      AbstractCegarLoop]: Abstraction has 76 states and 120 transitions.
[2025-04-28 21:21:25,942 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, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9)
[2025-04-28 21:21:25,942 INFO  L278                IsEmpty]: Start isEmpty. Operand 76 states and 120 transitions.
[2025-04-28 21:21:25,943 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:25,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,943 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:25,943 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-04-28 21:21:25,944 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,944 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1423270332, now seen corresponding path program 1 times
[2025-04-28 21:21:25,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,944 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057758989]
[2025-04-28 21:21:25,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:25,960 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:25,960 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,960 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:26,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,094 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057758989]
[2025-04-28 21:21:26,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057758989] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:26,095 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654593230]
[2025-04-28 21:21:26,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,095 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:26,097 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:26,099 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:26,103 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:26,136 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:26,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:26,157 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,159 INFO  L256         TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:26,160 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:26,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:26,234 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:27,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:27,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [654593230] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:27,257 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:27,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2025-04-28 21:21:27,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756732159]
[2025-04-28 21:21:27,259 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,259 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:27,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:27,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:27,261 INFO  L87              Difference]: Start difference. First operand 76 states and 120 transitions. Second operand  has 13 states, 7 states have (on average 4.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 8 states have call successors, (17)
[2025-04-28 21:21:27,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,588 INFO  L93              Difference]: Finished difference Result 84 states and 141 transitions.
[2025-04-28 21:21:27,589 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:27,589 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 7 states have (on average 4.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 8 states have call successors, (17) Word has length 36
[2025-04-28 21:21:27,589 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,590 INFO  L225             Difference]: With dead ends: 84
[2025-04-28 21:21:27,590 INFO  L226             Difference]: Without dead ends: 84
[2025-04-28 21:21:27,591 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:27,591 INFO  L437           NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,593 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 565 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:27,594 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-04-28 21:21:27,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82.
[2025-04-28 21:21:27,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 42 states have internal predecessors, (42), 30 states have call successors, (30), 11 states have call predecessors, (30), 20 states have return successors, (67), 28 states have call predecessors, (67), 30 states have call successors, (67)
[2025-04-28 21:21:27,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 139 transitions.
[2025-04-28 21:21:27,607 INFO  L79                 Accepts]: Start accepts. Automaton has 82 states and 139 transitions. Word has length 36
[2025-04-28 21:21:27,607 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,607 INFO  L485      AbstractCegarLoop]: Abstraction has 82 states and 139 transitions.
[2025-04-28 21:21:27,607 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 7 states have (on average 4.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 8 states have call successors, (17)
[2025-04-28 21:21:27,607 INFO  L278                IsEmpty]: Start isEmpty. Operand 82 states and 139 transitions.
[2025-04-28 21:21:27,609 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:27,609 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,609 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:27,615 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:27,813 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:27,813 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,814 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -1096636446, now seen corresponding path program 1 times
[2025-04-28 21:21:27,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,814 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592262243]
[2025-04-28 21:21:27,814 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,818 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:27,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:27,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:27,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,926 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592262243]
[2025-04-28 21:21:27,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592262243] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:27,926 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987406813]
[2025-04-28 21:21:27,926 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,926 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:27,928 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:27,931 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:27,935 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:27,978 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:27,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:27,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,999 INFO  L256         TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:28,000 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:28,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:28,062 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:28,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:28,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987406813] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:28,871 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:28,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2025-04-28 21:21:28,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796515556]
[2025-04-28 21:21:28,871 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,872 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:28,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,873 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:28,874 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:28,875 INFO  L87              Difference]: Start difference. First operand 82 states and 139 transitions. Second operand  has 13 states, 7 states have (on average 4.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 8 states have call successors, (17)
[2025-04-28 21:21:29,188 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:29,188 INFO  L93              Difference]: Finished difference Result 84 states and 140 transitions.
[2025-04-28 21:21:29,189 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:29,189 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 7 states have (on average 4.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 8 states have call successors, (17) Word has length 36
[2025-04-28 21:21:29,189 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:29,190 INFO  L225             Difference]: With dead ends: 84
[2025-04-28 21:21:29,190 INFO  L226             Difference]: Without dead ends: 84
[2025-04-28 21:21:29,190 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:29,191 INFO  L437           NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:29,191 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 565 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:29,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-04-28 21:21:29,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82.
[2025-04-28 21:21:29,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 42 states have internal predecessors, (42), 30 states have call successors, (30), 11 states have call predecessors, (30), 20 states have return successors, (66), 28 states have call predecessors, (66), 30 states have call successors, (66)
[2025-04-28 21:21:29,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions.
[2025-04-28 21:21:29,204 INFO  L79                 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 36
[2025-04-28 21:21:29,204 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:29,204 INFO  L485      AbstractCegarLoop]: Abstraction has 82 states and 138 transitions.
[2025-04-28 21:21:29,204 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 7 states have (on average 4.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 8 states have call successors, (17)
[2025-04-28 21:21:29,204 INFO  L278                IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions.
[2025-04-28 21:21:29,205 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:29,205 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,205 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:29,210 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:29,406 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:29,406 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,407 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 1324872976, now seen corresponding path program 1 times
[2025-04-28 21:21:29,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,408 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76786482]
[2025-04-28 21:21:29,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:29,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:29,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:29,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,494 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76786482]
[2025-04-28 21:21:29,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76786482] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,494 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163898611]
[2025-04-28 21:21:29,495 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,495 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,497 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,499 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:29,502 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,552 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:29,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:29,567 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,567 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,568 INFO  L256         TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:29,569 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:29,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:29,693 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:30,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:30,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163898611] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:30,596 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:30,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14
[2025-04-28 21:21:30,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251857614]
[2025-04-28 21:21:30,596 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,597 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:21:30,597 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:21:30,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:30,598 INFO  L87              Difference]: Start difference. First operand 82 states and 138 transitions. Second operand  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 13 states have internal predecessors, (29), 10 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 10 states have call successors, (16)
[2025-04-28 21:21:30,997 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,997 INFO  L93              Difference]: Finished difference Result 84 states and 138 transitions.
[2025-04-28 21:21:30,998 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:30,998 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 13 states have internal predecessors, (29), 10 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 10 states have call successors, (16) Word has length 28
[2025-04-28 21:21:30,998 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,999 INFO  L225             Difference]: With dead ends: 84
[2025-04-28 21:21:30,999 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:30,999 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:31,000 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,000 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1025 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:31,001 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:31,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80.
[2025-04-28 21:21:31,008 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 28 states have call successors, (28), 11 states have call predecessors, (28), 20 states have return successors, (63), 27 states have call predecessors, (63), 28 states have call successors, (63)
[2025-04-28 21:21:31,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 132 transitions.
[2025-04-28 21:21:31,009 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 132 transitions. Word has length 28
[2025-04-28 21:21:31,010 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,010 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 132 transitions.
[2025-04-28 21:21:31,010 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 13 states have internal predecessors, (29), 10 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 10 states have call successors, (16)
[2025-04-28 21:21:31,010 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 132 transitions.
[2025-04-28 21:21:31,011 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:31,011 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,011 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:31,017 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:31,215 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,215 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,216 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,216 INFO  L85        PathProgramCache]: Analyzing trace with hash 834739141, now seen corresponding path program 1 times
[2025-04-28 21:21:31,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,216 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721089976]
[2025-04-28 21:21:31,216 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,220 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:31,224 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:31,224 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,224 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,308 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721089976]
[2025-04-28 21:21:31,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721089976] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,308 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28892640]
[2025-04-28 21:21:31,308 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,308 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,310 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,313 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:31,316 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:31,378 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:31,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,380 INFO  L256         TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,381 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:31,485 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:32,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:32,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [28892640] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:32,306 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:32,306 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14
[2025-04-28 21:21:32,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253237416]
[2025-04-28 21:21:32,307 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,308 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:21:32,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,309 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:21:32,309 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:32,309 INFO  L87              Difference]: Start difference. First operand 80 states and 132 transitions. Second operand  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 13 states have internal predecessors, (29), 10 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 10 states have call successors, (16)
[2025-04-28 21:21:32,649 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,649 INFO  L93              Difference]: Finished difference Result 84 states and 134 transitions.
[2025-04-28 21:21:32,650 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:32,650 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 13 states have internal predecessors, (29), 10 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 10 states have call successors, (16) Word has length 28
[2025-04-28 21:21:32,650 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,651 INFO  L225             Difference]: With dead ends: 84
[2025-04-28 21:21:32,651 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:32,652 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:32,652 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 8 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,654 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 847 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:32,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:32,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78.
[2025-04-28 21:21:32,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 40 states have internal predecessors, (40), 26 states have call successors, (26), 11 states have call predecessors, (26), 20 states have return successors, (60), 26 states have call predecessors, (60), 26 states have call successors, (60)
[2025-04-28 21:21:32,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 126 transitions.
[2025-04-28 21:21:32,664 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 126 transitions. Word has length 28
[2025-04-28 21:21:32,664 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,664 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 126 transitions.
[2025-04-28 21:21:32,664 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 13 states have internal predecessors, (29), 10 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 10 states have call successors, (16)
[2025-04-28 21:21:32,664 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 126 transitions.
[2025-04-28 21:21:32,667 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:32,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,667 INFO  L218           NwaCegarLoop]: trace histogram [3, 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, 1]
[2025-04-28 21:21:32,674 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-04-28 21:21:32,871 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,871 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,872 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -2020304107, now seen corresponding path program 1 times
[2025-04-28 21:21:32,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,872 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219021618]
[2025-04-28 21:21:32,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,877 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:32,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:32,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:32,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,994 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219021618]
[2025-04-28 21:21:32,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219021618] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:32,994 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534624648]
[2025-04-28 21:21:32,994 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,995 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,997 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,000 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,005 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,066 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:33,101 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:33,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,103 INFO  L256         TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,105 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:33,185 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:33,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [534624648] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:33,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13
[2025-04-28 21:21:33,186 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381059591]
[2025-04-28 21:21:33,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,186 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:33,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,187 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:33,187 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:33,187 INFO  L87              Difference]: Start difference. First operand 78 states and 126 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, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10)
[2025-04-28 21:21:33,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,334 INFO  L93              Difference]: Finished difference Result 78 states and 125 transitions.
[2025-04-28 21:21:33,335 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:33,335 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, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40
[2025-04-28 21:21:33,336 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,337 INFO  L225             Difference]: With dead ends: 78
[2025-04-28 21:21:33,337 INFO  L226             Difference]: Without dead ends: 78
[2025-04-28 21:21:33,338 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:33,338 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,338 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 343 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:33,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2025-04-28 21:21:33,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76.
[2025-04-28 21:21:33,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 30 states have (on average 1.3) internal successors, (39), 39 states have internal predecessors, (39), 26 states have call successors, (26), 11 states have call predecessors, (26), 19 states have return successors, (57), 25 states have call predecessors, (57), 26 states have call successors, (57)
[2025-04-28 21:21:33,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions.
[2025-04-28 21:21:33,346 INFO  L79                 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 40
[2025-04-28 21:21:33,347 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,347 INFO  L485      AbstractCegarLoop]: Abstraction has 76 states and 122 transitions.
[2025-04-28 21:21:33,347 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, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10)
[2025-04-28 21:21:33,347 INFO  L278                IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions.
[2025-04-28 21:21:33,348 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:33,348 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,348 INFO  L218           NwaCegarLoop]: trace histogram [4, 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]
[2025-04-28 21:21:33,354 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-04-28 21:21:33,549 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2025-04-28 21:21:33,549 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,549 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 506327680, now seen corresponding path program 2 times
[2025-04-28 21:21:33,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,550 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271763578]
[2025-04-28 21:21:33,550 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,555 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:21:33,560 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:33,561 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,561 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:33,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,666 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271763578]
[2025-04-28 21:21:33,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271763578] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,666 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610701714]
[2025-04-28 21:21:33,666 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,666 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,668 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,671 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,673 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,728 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:21:33,749 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:33,749 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,751 INFO  L256         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,752 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:33,860 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:35,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [610701714] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:35,279 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:35,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 19
[2025-04-28 21:21:35,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599069620]
[2025-04-28 21:21:35,280 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,280 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:35,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,281 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:35,281 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:35,282 INFO  L87              Difference]: Start difference. First operand 76 states and 122 transitions. Second operand  has 19 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 19 states have internal predecessors, (34), 12 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (22), 8 states have call predecessors, (22), 12 states have call successors, (22)
[2025-04-28 21:21:35,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,666 INFO  L93              Difference]: Finished difference Result 82 states and 134 transitions.
[2025-04-28 21:21:35,667 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:35,667 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 19 states have internal predecessors, (34), 12 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (22), 8 states have call predecessors, (22), 12 states have call successors, (22) Word has length 40
[2025-04-28 21:21:35,667 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,668 INFO  L225             Difference]: With dead ends: 82
[2025-04-28 21:21:35,668 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:35,668 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:35,669 INFO  L437           NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,669 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 651 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:35,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:35,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80.
[2025-04-28 21:21:35,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 26 states have call successors, (26), 11 states have call predecessors, (26), 21 states have return successors, (65), 27 states have call predecessors, (65), 26 states have call successors, (65)
[2025-04-28 21:21:35,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 132 transitions.
[2025-04-28 21:21:35,678 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 132 transitions. Word has length 40
[2025-04-28 21:21:35,679 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,679 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 132 transitions.
[2025-04-28 21:21:35,679 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 19 states have internal predecessors, (34), 12 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (22), 8 states have call predecessors, (22), 12 states have call successors, (22)
[2025-04-28 21:21:35,679 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 132 transitions.
[2025-04-28 21:21:35,680 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:35,680 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,680 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:35,686 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:35,881 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,881 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,881 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,882 INFO  L85        PathProgramCache]: Analyzing trace with hash -917661785, now seen corresponding path program 1 times
[2025-04-28 21:21:35,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,882 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341555625]
[2025-04-28 21:21:35,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,886 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:35,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:35,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:35,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,999 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341555625]
[2025-04-28 21:21:36,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341555625] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,000 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772463470]
[2025-04-28 21:21:36,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,000 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,002 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,005 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:36,009 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,080 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:36,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:36,103 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,104 INFO  L256         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,106 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:36,228 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:36,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:36,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [772463470] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:36,997 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:36,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19
[2025-04-28 21:21:36,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121599805]
[2025-04-28 21:21:36,998 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,998 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:36,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:36,999 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:36,999 INFO  L87              Difference]: Start difference. First operand 80 states and 132 transitions. Second operand  has 19 states, 10 states have (on average 3.7) internal successors, (37), 19 states have internal predecessors, (37), 11 states have call successors, (19), 2 states have call predecessors, (19), 10 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20)
[2025-04-28 21:21:37,472 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,472 INFO  L93              Difference]: Finished difference Result 80 states and 131 transitions.
[2025-04-28 21:21:37,473 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:37,473 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 10 states have (on average 3.7) internal successors, (37), 19 states have internal predecessors, (37), 11 states have call successors, (19), 2 states have call predecessors, (19), 10 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) Word has length 40
[2025-04-28 21:21:37,473 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,474 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:37,474 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:37,475 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702
[2025-04-28 21:21:37,476 INFO  L437           NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,476 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 835 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:37,477 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:37,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2025-04-28 21:21:37,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 26 states have call successors, (26), 11 states have call predecessors, (26), 21 states have return successors, (64), 27 states have call predecessors, (64), 26 states have call successors, (64)
[2025-04-28 21:21:37,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 131 transitions.
[2025-04-28 21:21:37,483 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 131 transitions. Word has length 40
[2025-04-28 21:21:37,483 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,483 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 131 transitions.
[2025-04-28 21:21:37,484 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 10 states have (on average 3.7) internal successors, (37), 19 states have internal predecessors, (37), 11 states have call successors, (19), 2 states have call predecessors, (19), 10 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20)
[2025-04-28 21:21:37,484 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions.
[2025-04-28 21:21:37,485 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:37,485 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,485 INFO  L218           NwaCegarLoop]: trace histogram [4, 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]
[2025-04-28 21:21:37,490 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2025-04-28 21:21:37,689 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-04-28 21:21:37,689 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,689 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 1468647334, now seen corresponding path program 2 times
[2025-04-28 21:21:37,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,690 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493208067]
[2025-04-28 21:21:37,690 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:37,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,693 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:21:37,698 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:37,699 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:37,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:37,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,818 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493208067]
[2025-04-28 21:21:37,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493208067] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,818 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869369731]
[2025-04-28 21:21:37,818 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:37,818 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,820 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,823 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,826 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,903 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:21:37,924 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:37,924 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:37,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,926 INFO  L256         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,928 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:38,013 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:39,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:39,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869369731] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:39,150 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:39,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 19
[2025-04-28 21:21:39,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155428940]
[2025-04-28 21:21:39,150 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,151 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:39,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,151 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:39,151 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:39,152 INFO  L87              Difference]: Start difference. First operand 80 states and 131 transitions. Second operand  has 19 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 19 states have internal predecessors, (34), 12 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (22), 8 states have call predecessors, (22), 12 states have call successors, (22)
[2025-04-28 21:21:39,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,631 INFO  L93              Difference]: Finished difference Result 82 states and 132 transitions.
[2025-04-28 21:21:39,631 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:39,631 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 19 states have internal predecessors, (34), 12 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (22), 8 states have call predecessors, (22), 12 states have call successors, (22) Word has length 40
[2025-04-28 21:21:39,633 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,634 INFO  L225             Difference]: With dead ends: 82
[2025-04-28 21:21:39,634 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:39,635 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:39,635 INFO  L437           NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,635 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 751 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:39,636 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:39,642 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80.
[2025-04-28 21:21:39,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 26 states have call successors, (26), 11 states have call predecessors, (26), 21 states have return successors, (63), 27 states have call predecessors, (63), 26 states have call successors, (63)
[2025-04-28 21:21:39,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 130 transitions.
[2025-04-28 21:21:39,643 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 130 transitions. Word has length 40
[2025-04-28 21:21:39,643 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,644 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 130 transitions.
[2025-04-28 21:21:39,644 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 19 states have internal predecessors, (34), 12 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (22), 8 states have call predecessors, (22), 12 states have call successors, (22)
[2025-04-28 21:21:39,644 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 130 transitions.
[2025-04-28 21:21:39,645 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-04-28 21:21:39,645 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,646 INFO  L218           NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,652 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2025-04-28 21:21:39,846 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2025-04-28 21:21:39,846 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,847 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 387998999, now seen corresponding path program 1 times
[2025-04-28 21:21:39,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,847 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662859477]
[2025-04-28 21:21:39,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-04-28 21:21:39,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-04-28 21:21:39,862 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,862 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 118 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-04-28 21:21:39,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,995 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662859477]
[2025-04-28 21:21:39,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662859477] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,995 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615081859]
[2025-04-28 21:21:39,995 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,995 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,998 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,000 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:40,003 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-04-28 21:21:40,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-04-28 21:21:40,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,171 INFO  L256         TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,173 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2025-04-28 21:21:40,222 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2025-04-28 21:21:40,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [615081859] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,606 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11
[2025-04-28 21:21:40,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678722021]
[2025-04-28 21:21:40,606 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,607 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:40,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:40,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:40,608 INFO  L87              Difference]: Start difference. First operand 80 states and 130 transitions. Second operand  has 11 states, 8 states have (on average 3.5) internal successors, (28), 10 states have internal predecessors, (28), 7 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (21), 9 states have call predecessors, (21), 7 states have call successors, (21)
[2025-04-28 21:21:40,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,837 INFO  L93              Difference]: Finished difference Result 90 states and 146 transitions.
[2025-04-28 21:21:40,837 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:40,837 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 3.5) internal successors, (28), 10 states have internal predecessors, (28), 7 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (21), 9 states have call predecessors, (21), 7 states have call successors, (21) Word has length 76
[2025-04-28 21:21:40,838 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,838 INFO  L225             Difference]: With dead ends: 90
[2025-04-28 21:21:40,839 INFO  L226             Difference]: Without dead ends: 82
[2025-04-28 21:21:40,839 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:40,839 INFO  L437           NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,840 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 713 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:40,840 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2025-04-28 21:21:40,844 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76.
[2025-04-28 21:21:40,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 30 states have (on average 1.3) internal successors, (39), 39 states have internal predecessors, (39), 26 states have call successors, (26), 11 states have call predecessors, (26), 19 states have return successors, (51), 25 states have call predecessors, (51), 26 states have call successors, (51)
[2025-04-28 21:21:40,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions.
[2025-04-28 21:21:40,846 INFO  L79                 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 76
[2025-04-28 21:21:40,846 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,846 INFO  L485      AbstractCegarLoop]: Abstraction has 76 states and 116 transitions.
[2025-04-28 21:21:40,846 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 3.5) internal successors, (28), 10 states have internal predecessors, (28), 7 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (21), 9 states have call predecessors, (21), 7 states have call successors, (21)
[2025-04-28 21:21:40,846 INFO  L278                IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions.
[2025-04-28 21:21:40,847 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:21:40,847 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,847 INFO  L218           NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,852 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:41,048 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2025-04-28 21:21:41,048 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,048 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,048 INFO  L85        PathProgramCache]: Analyzing trace with hash 620124395, now seen corresponding path program 2 times
[2025-04-28 21:21:41,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,048 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193072288]
[2025-04-28 21:21:41,048 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,053 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes.
[2025-04-28 21:21:41,059 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:41,059 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:41,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-04-28 21:21:41,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,128 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193072288]
[2025-04-28 21:21:41,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193072288] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,128 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145969374]
[2025-04-28 21:21:41,128 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,129 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,131 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,133 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:41,134 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,218 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes.
[2025-04-28 21:21:41,240 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:41,240 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:41,240 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,241 INFO  L256         TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,242 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:41,413 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:43,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145969374] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,245 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 23
[2025-04-28 21:21:43,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158257882]
[2025-04-28 21:21:43,245 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,246 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:43,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,246 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:43,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:43,247 INFO  L87              Difference]: Start difference. First operand 76 states and 116 transitions. Second operand  has 23 states, 11 states have (on average 3.727272727272727) internal successors, (41), 22 states have internal predecessors, (41), 16 states have call successors, (24), 2 states have call predecessors, (24), 11 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26)
[2025-04-28 21:21:43,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,983 INFO  L93              Difference]: Finished difference Result 94 states and 157 transitions.
[2025-04-28 21:21:43,983 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-04-28 21:21:43,983 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 11 states have (on average 3.727272727272727) internal successors, (41), 22 states have internal predecessors, (41), 16 states have call successors, (24), 2 states have call predecessors, (24), 11 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) Word has length 44
[2025-04-28 21:21:43,983 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,984 INFO  L225             Difference]: With dead ends: 94
[2025-04-28 21:21:43,985 INFO  L226             Difference]: Without dead ends: 93
[2025-04-28 21:21:43,985 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:21:43,986 INFO  L437           NwaCegarLoop]: 71 mSDtfsCounter, 19 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,987 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 995 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:43,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-04-28 21:21:43,996 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78.
[2025-04-28 21:21:43,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 40 states have internal predecessors, (40), 26 states have call successors, (26), 11 states have call predecessors, (26), 20 states have return successors, (58), 26 states have call predecessors, (58), 26 states have call successors, (58)
[2025-04-28 21:21:43,997 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 124 transitions.
[2025-04-28 21:21:43,997 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 124 transitions. Word has length 44
[2025-04-28 21:21:43,997 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,997 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 124 transitions.
[2025-04-28 21:21:43,997 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 11 states have (on average 3.727272727272727) internal successors, (41), 22 states have internal predecessors, (41), 16 states have call successors, (24), 2 states have call predecessors, (24), 11 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26)
[2025-04-28 21:21:43,997 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 124 transitions.
[2025-04-28 21:21:44,002 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:21:44,002 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,003 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,010 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0
[2025-04-28 21:21:44,203 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2025-04-28 21:21:44,203 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,203 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,203 INFO  L85        PathProgramCache]: Analyzing trace with hash -151981760, now seen corresponding path program 1 times
[2025-04-28 21:21:44,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,204 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188449519]
[2025-04-28 21:21:44,204 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:21:44,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:44,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,213 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:44,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,247 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188449519]
[2025-04-28 21:21:44,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188449519] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,247 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578765891]
[2025-04-28 21:21:44,247 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,248 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,250 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,252 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:44,256 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:21:44,392 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:44,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,393 INFO  L256         TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,394 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:44,419 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:44,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578765891] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:44,655 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:44,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-04-28 21:21:44,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722823722]
[2025-04-28 21:21:44,655 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,656 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:44,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,656 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:44,656 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:44,657 INFO  L87              Difference]: Start difference. First operand 78 states and 124 transitions. Second operand  has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17)
[2025-04-28 21:21:44,774 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,774 INFO  L93              Difference]: Finished difference Result 80 states and 126 transitions.
[2025-04-28 21:21:44,775 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:44,775 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 44
[2025-04-28 21:21:44,775 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,776 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:44,776 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:44,776 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:44,776 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,777 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 474 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:44,777 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:44,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2025-04-28 21:21:44,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 26 states have call successors, (26), 11 states have call predecessors, (26), 21 states have return successors, (59), 27 states have call predecessors, (59), 26 states have call successors, (59)
[2025-04-28 21:21:44,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions.
[2025-04-28 21:21:44,783 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 44
[2025-04-28 21:21:44,783 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,783 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 126 transitions.
[2025-04-28 21:21:44,783 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17)
[2025-04-28 21:21:44,784 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions.
[2025-04-28 21:21:44,784 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:21:44,784 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,785 INFO  L218           NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,791 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0
[2025-04-28 21:21:44,985 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-04-28 21:21:44,985 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,986 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -1276414779, now seen corresponding path program 1 times
[2025-04-28 21:21:44,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,986 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139060584]
[2025-04-28 21:21:44,986 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:21:44,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:44,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:45,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,139 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139060584]
[2025-04-28 21:21:45,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139060584] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,139 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404992257]
[2025-04-28 21:21:45,139 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,139 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,141 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,143 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:45,147 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,253 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:21:45,276 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:45,276 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,276 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,278 INFO  L256         TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,279 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:45,360 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:47,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:47,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [404992257] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:47,061 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:47,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 19
[2025-04-28 21:21:47,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157410521]
[2025-04-28 21:21:47,061 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,061 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:47,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:47,062 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:47,062 INFO  L87              Difference]: Start difference. First operand 80 states and 126 transitions. Second operand  has 19 states, 10 states have (on average 3.4) internal successors, (34), 19 states have internal predecessors, (34), 11 states have call successors, (18), 2 states have call predecessors, (18), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22)
[2025-04-28 21:21:47,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,461 INFO  L93              Difference]: Finished difference Result 90 states and 150 transitions.
[2025-04-28 21:21:47,461 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:47,462 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 10 states have (on average 3.4) internal successors, (34), 19 states have internal predecessors, (34), 11 states have call successors, (18), 2 states have call predecessors, (18), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) Word has length 44
[2025-04-28 21:21:47,462 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,463 INFO  L225             Difference]: With dead ends: 90
[2025-04-28 21:21:47,463 INFO  L226             Difference]: Without dead ends: 90
[2025-04-28 21:21:47,463 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:47,464 INFO  L437           NwaCegarLoop]: 69 mSDtfsCounter, 12 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,464 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 718 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:47,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2025-04-28 21:21:47,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88.
[2025-04-28 21:21:47,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 36 states have (on average 1.25) internal successors, (45), 45 states have internal predecessors, (45), 26 states have call successors, (26), 11 states have call predecessors, (26), 25 states have return successors, (77), 31 states have call predecessors, (77), 26 states have call successors, (77)
[2025-04-28 21:21:47,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 148 transitions.
[2025-04-28 21:21:47,471 INFO  L79                 Accepts]: Start accepts. Automaton has 88 states and 148 transitions. Word has length 44
[2025-04-28 21:21:47,471 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,471 INFO  L485      AbstractCegarLoop]: Abstraction has 88 states and 148 transitions.
[2025-04-28 21:21:47,472 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 10 states have (on average 3.4) internal successors, (34), 19 states have internal predecessors, (34), 11 states have call successors, (18), 2 states have call predecessors, (18), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22)
[2025-04-28 21:21:47,472 INFO  L278                IsEmpty]: Start isEmpty. Operand 88 states and 148 transitions.
[2025-04-28 21:21:47,473 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-04-28 21:21:47,473 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,473 INFO  L218           NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 3, 3, 3, 3, 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:47,479 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:47,677 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-04-28 21:21:47,677 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,678 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -109494765, now seen corresponding path program 1 times
[2025-04-28 21:21:47,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,678 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614943311]
[2025-04-28 21:21:47,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,684 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-04-28 21:21:47,689 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-04-28 21:21:47,689 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,689 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2025-04-28 21:21:47,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,809 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614943311]
[2025-04-28 21:21:47,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614943311] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,809 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467442651]
[2025-04-28 21:21:47,809 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,809 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,811 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,813 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:47,817 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,944 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-04-28 21:21:48,007 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-04-28 21:21:48,007 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,007 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,009 INFO  L256         TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:48,011 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:48,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 8 proven. 53 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2025-04-28 21:21:48,230 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
