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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:32,038 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:32,102 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1500e66-d647-4952-b952-a748529bf88f/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:32,108 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:32,108 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:32,144 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:32,144 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:32,144 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:32,145 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:32,145 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:32,145 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:32,145 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:32,145 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:32,145 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:32,146 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:32,146 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:32,146 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:32,146 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:32,146 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:32,146 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:32,146 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:32,147 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:32,147 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:32,147 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:32,147 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:32,148 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:32,148 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:32,438 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:32,451 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:32,453 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:32,456 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:32,457 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:32,458 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1500e66-d647-4952-b952-a748529bf88f/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-065.smt2
[2025-04-28 21:21:32,460 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:32,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:32,881 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1500e66-d647-4952-b952-a748529bf88f/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-065.smt2
[2025-04-28 21:21:32,885 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:32,886 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:32,887 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:32,887 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:32,887 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:32,891 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,962 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32 Unit
[2025-04-28 21:21:32,964 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:32,965 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:32,965 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:32,965 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:32,982 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:32,982 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,025 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,025 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,034 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,039 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,041 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,047 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,048 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,076 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:33,077 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:33,077 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:33,077 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:33,078 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (1/1) ...
[2025-04-28 21:21:33,081 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:33,092 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,104 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:33,109 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:33,123 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:33,123 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:33,123 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:33,124 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:33,124 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:33,124 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:33,124 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb124.i given in one single declaration
[2025-04-28 21:21:33,124 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb124.i
[2025-04-28 21:21:33,124 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb124.i
[2025-04-28 21:21:33,124 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb110.i given in one single declaration
[2025-04-28 21:21:33,124 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb110.i
[2025-04-28 21:21:33,124 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb110.i
[2025-04-28 21:21:33,124 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb96.i given in one single declaration
[2025-04-28 21:21:33,124 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb96.i
[2025-04-28 21:21:33,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb96.i
[2025-04-28 21:21:33,125 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb82.i given in one single declaration
[2025-04-28 21:21:33,125 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb82.i
[2025-04-28 21:21:33,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb82.i
[2025-04-28 21:21:33,125 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb68.i given in one single declaration
[2025-04-28 21:21:33,127 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb68.i
[2025-04-28 21:21:33,127 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb68.i
[2025-04-28 21:21:33,127 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb54.i given in one single declaration
[2025-04-28 21:21:33,127 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb54.i
[2025-04-28 21:21:33,128 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb54.i
[2025-04-28 21:21:33,128 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb40.i given in one single declaration
[2025-04-28 21:21:33,128 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb40.i
[2025-04-28 21:21:33,128 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb40.i
[2025-04-28 21:21:33,128 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb23.i given in one single declaration
[2025-04-28 21:21:33,128 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb23.i
[2025-04-28 21:21:33,128 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb23.i
[2025-04-28 21:21:33,128 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:33,128 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:33,128 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:33,128 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:33,128 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:33,129 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:33,297 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:33,299 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:33,543 INFO  L?                        ?]: Removed 148 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:33,543 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:33,555 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:33,555 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-04-28 21:21:33,556 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33 BoogieIcfgContainer
[2025-04-28 21:21:33,556 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:33,559 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:33,559 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:33,563 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:33,563 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:32" (1/3) ...
[2025-04-28 21:21:33,564 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e0a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,564 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:32" (2/3) ...
[2025-04-28 21:21:33,564 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e0a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,564 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33" (3/3) ...
[2025-04-28 21:21:33,566 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:33,582 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:33,585 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 12 procedures, 54 locations, 88 edges, 12 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:33,630 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:33,642 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;@2cccafd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:33,642 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:33,647 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 54 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 31 states have internal predecessors, (31), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19)
[2025-04-28 21:21:33,655 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2025-04-28 21:21:33,656 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,656 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,657 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,662 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,663 INFO  L85        PathProgramCache]: Analyzing trace with hash 896930892, now seen corresponding path program 1 times
[2025-04-28 21:21:33,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,671 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563327414]
[2025-04-28 21:21:33,671 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,713 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-04-28 21:21:33,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-04-28 21:21:33,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:34,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,439 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563327414]
[2025-04-28 21:21:34,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563327414] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:34,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627789556]
[2025-04-28 21:21:34,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,449 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:34,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,474 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:34,475 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:34,477 INFO  L87              Difference]: Start difference. First operand  has 54 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 31 states have internal predecessors, (31), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) Second operand  has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:34,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,682 INFO  L93              Difference]: Finished difference Result 58 states and 75 transitions.
[2025-04-28 21:21:34,684 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:34,686 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 43
[2025-04-28 21:21:34,687 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,703 INFO  L225             Difference]: With dead ends: 58
[2025-04-28 21:21:34,704 INFO  L226             Difference]: Without dead ends: 58
[2025-04-28 21:21:34,712 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:34,717 INFO  L437           NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,718 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 300 Invalid, 28 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2025-04-28 21:21:34,776 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56.
[2025-04-28 21:21:34,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 31 states have internal predecessors, (31), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (22), 13 states have call predecessors, (22), 19 states have call successors, (22)
[2025-04-28 21:21:34,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions.
[2025-04-28 21:21:34,786 INFO  L79                 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 43
[2025-04-28 21:21:34,787 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,788 INFO  L485      AbstractCegarLoop]: Abstraction has 56 states and 72 transitions.
[2025-04-28 21:21:34,788 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:34,788 INFO  L278                IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions.
[2025-04-28 21:21:34,804 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-04-28 21:21:34,805 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,805 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,805 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:34,806 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,808 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 802094675, now seen corresponding path program 1 times
[2025-04-28 21:21:34,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,808 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50539271]
[2025-04-28 21:21:34,809 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,840 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-04-28 21:21:34,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-04-28 21:21:34,888 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,888 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:35,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,338 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50539271]
[2025-04-28 21:21:35,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50539271] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:35,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:35,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:35,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777600471]
[2025-04-28 21:21:35,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,340 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:35,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,340 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:35,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:35,341 INFO  L87              Difference]: Start difference. First operand 56 states and 72 transitions. Second operand  has 8 states, 5 states have (on average 4.4) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12)
[2025-04-28 21:21:35,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,535 INFO  L93              Difference]: Finished difference Result 68 states and 88 transitions.
[2025-04-28 21:21:35,537 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:35,538 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 4.4) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 47
[2025-04-28 21:21:35,538 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,539 INFO  L225             Difference]: With dead ends: 68
[2025-04-28 21:21:35,539 INFO  L226             Difference]: Without dead ends: 68
[2025-04-28 21:21:35,540 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:35,540 INFO  L437           NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,541 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 411 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:35,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2025-04-28 21:21:35,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60.
[2025-04-28 21:21:35,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 25 states have (on average 1.32) internal successors, (33), 33 states have internal predecessors, (33), 19 states have call successors, (19), 11 states have call predecessors, (19), 15 states have return successors, (26), 15 states have call predecessors, (26), 19 states have call successors, (26)
[2025-04-28 21:21:35,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions.
[2025-04-28 21:21:35,559 INFO  L79                 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 47
[2025-04-28 21:21:35,560 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,560 INFO  L485      AbstractCegarLoop]: Abstraction has 60 states and 78 transitions.
[2025-04-28 21:21:35,560 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 4.4) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12)
[2025-04-28 21:21:35,562 INFO  L278                IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions.
[2025-04-28 21:21:35,565 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-04-28 21:21:35,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,566 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:35,566 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:35,568 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,569 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -551417551, now seen corresponding path program 1 times
[2025-04-28 21:21:35,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,569 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895434442]
[2025-04-28 21:21:35,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-04-28 21:21:35,620 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-04-28 21:21:35,621 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,621 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:36,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,024 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895434442]
[2025-04-28 21:21:36,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895434442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-04-28 21:21:36,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886689386]
[2025-04-28 21:21:36,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,025 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:36,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:36,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:36,026 INFO  L87              Difference]: Start difference. First operand 60 states and 78 transitions. Second operand  has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 11 states have internal predecessors, (22), 4 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12)
[2025-04-28 21:21:36,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,344 INFO  L93              Difference]: Finished difference Result 64 states and 82 transitions.
[2025-04-28 21:21:36,344 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:36,344 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 11 states have internal predecessors, (22), 4 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) Word has length 47
[2025-04-28 21:21:36,345 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,346 INFO  L225             Difference]: With dead ends: 64
[2025-04-28 21:21:36,346 INFO  L226             Difference]: Without dead ends: 64
[2025-04-28 21:21:36,346 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:36,347 INFO  L437           NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,347 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 486 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:36,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2025-04-28 21:21:36,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62.
[2025-04-28 21:21:36,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 34 states have internal predecessors, (34), 19 states have call successors, (19), 11 states have call predecessors, (19), 16 states have return successors, (26), 16 states have call predecessors, (26), 19 states have call successors, (26)
[2025-04-28 21:21:36,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions.
[2025-04-28 21:21:36,357 INFO  L79                 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 47
[2025-04-28 21:21:36,357 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,357 INFO  L485      AbstractCegarLoop]: Abstraction has 62 states and 79 transitions.
[2025-04-28 21:21:36,358 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 11 states have internal predecessors, (22), 4 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12)
[2025-04-28 21:21:36,358 INFO  L278                IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions.
[2025-04-28 21:21:36,359 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-04-28 21:21:36,359 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,359 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,359 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:36,360 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,360 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1459483272, now seen corresponding path program 1 times
[2025-04-28 21:21:36,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,360 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913604067]
[2025-04-28 21:21:36,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-04-28 21:21:36,409 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-04-28 21:21:36,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:36,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,742 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913604067]
[2025-04-28 21:21:36,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913604067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,742 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-04-28 21:21:36,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783868264]
[2025-04-28 21:21:36,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,742 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:36,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,743 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:36,743 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:36,744 INFO  L87              Difference]: Start difference. First operand 62 states and 79 transitions. Second operand  has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13)
[2025-04-28 21:21:37,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,005 INFO  L93              Difference]: Finished difference Result 56 states and 71 transitions.
[2025-04-28 21:21:37,006 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:37,006 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 51
[2025-04-28 21:21:37,006 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,010 INFO  L225             Difference]: With dead ends: 56
[2025-04-28 21:21:37,010 INFO  L226             Difference]: Without dead ends: 56
[2025-04-28 21:21:37,010 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:37,011 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,011 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:37,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2025-04-28 21:21:37,026 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2025-04-28 21:21:37,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 31 states have internal predecessors, (31), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 13 states have call predecessors, (21), 19 states have call successors, (21)
[2025-04-28 21:21:37,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions.
[2025-04-28 21:21:37,027 INFO  L79                 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 51
[2025-04-28 21:21:37,028 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,028 INFO  L485      AbstractCegarLoop]: Abstraction has 56 states and 71 transitions.
[2025-04-28 21:21:37,028 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13)
[2025-04-28 21:21:37,028 INFO  L278                IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions.
[2025-04-28 21:21:37,031 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-04-28 21:21:37,031 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,031 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,032 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:37,032 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,032 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,032 INFO  L85        PathProgramCache]: Analyzing trace with hash -1958794525, now seen corresponding path program 1 times
[2025-04-28 21:21:37,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,032 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168739302]
[2025-04-28 21:21:37,033 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-04-28 21:21:37,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-04-28 21:21:37,071 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,071 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:37,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,398 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168739302]
[2025-04-28 21:21:37,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168739302] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:37,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:37,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215656773]
[2025-04-28 21:21:37,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,399 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:37,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:37,400 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:37,400 INFO  L87              Difference]: Start difference. First operand 56 states and 71 transitions. Second operand  has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)
[2025-04-28 21:21:37,580 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,580 INFO  L93              Difference]: Finished difference Result 70 states and 89 transitions.
[2025-04-28 21:21:37,582 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:37,582 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 51
[2025-04-28 21:21:37,583 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,584 INFO  L225             Difference]: With dead ends: 70
[2025-04-28 21:21:37,584 INFO  L226             Difference]: Without dead ends: 70
[2025-04-28 21:21:37,584 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:37,586 INFO  L437           NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,590 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 455 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:37,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2025-04-28 21:21:37,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68.
[2025-04-28 21:21:37,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 37 states have internal predecessors, (37), 19 states have call successors, (19), 11 states have call predecessors, (19), 19 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30)
[2025-04-28 21:21:37,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions.
[2025-04-28 21:21:37,606 INFO  L79                 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 51
[2025-04-28 21:21:37,607 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,607 INFO  L485      AbstractCegarLoop]: Abstraction has 68 states and 86 transitions.
[2025-04-28 21:21:37,607 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)
[2025-04-28 21:21:37,607 INFO  L278                IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions.
[2025-04-28 21:21:37,610 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-04-28 21:21:37,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,611 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, 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,611 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:37,612 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,612 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,612 INFO  L85        PathProgramCache]: Analyzing trace with hash 1114822152, now seen corresponding path program 1 times
[2025-04-28 21:21:37,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,613 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540435933]
[2025-04-28 21:21:37,613 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,635 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-04-28 21:21:37,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-04-28 21:21:37,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:37,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,983 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540435933]
[2025-04-28 21:21:37,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540435933] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:37,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:37,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448987532]
[2025-04-28 21:21:37,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,984 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:37,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:37,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:37,988 INFO  L87              Difference]: Start difference. First operand 68 states and 86 transitions. Second operand  has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14)
[2025-04-28 21:21:38,164 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,164 INFO  L93              Difference]: Finished difference Result 58 states and 73 transitions.
[2025-04-28 21:21:38,165 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:38,165 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 55
[2025-04-28 21:21:38,166 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,166 INFO  L225             Difference]: With dead ends: 58
[2025-04-28 21:21:38,166 INFO  L226             Difference]: Without dead ends: 58
[2025-04-28 21:21:38,167 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:38,168 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 422 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.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,168 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 422 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:38,172 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2025-04-28 21:21:38,179 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2025-04-28 21:21:38,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 32 states have internal predecessors, (32), 19 states have call successors, (19), 11 states have call predecessors, (19), 14 states have return successors, (22), 14 states have call predecessors, (22), 19 states have call successors, (22)
[2025-04-28 21:21:38,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions.
[2025-04-28 21:21:38,180 INFO  L79                 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 55
[2025-04-28 21:21:38,180 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,180 INFO  L485      AbstractCegarLoop]: Abstraction has 58 states and 73 transitions.
[2025-04-28 21:21:38,181 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14)
[2025-04-28 21:21:38,181 INFO  L278                IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions.
[2025-04-28 21:21:38,184 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-04-28 21:21:38,184 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,184 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:38,184 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,185 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -138941972, now seen corresponding path program 1 times
[2025-04-28 21:21:38,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,185 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075980737]
[2025-04-28 21:21:38,185 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,205 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-04-28 21:21:38,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-04-28 21:21:38,235 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,235 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:38,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,599 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075980737]
[2025-04-28 21:21:38,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075980737] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:38,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:38,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-04-28 21:21:38,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378439186]
[2025-04-28 21:21:38,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,600 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:38,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,600 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:38,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:38,601 INFO  L87              Difference]: Start difference. First operand 58 states and 73 transitions. Second operand  has 10 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14)
[2025-04-28 21:21:38,782 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,782 INFO  L93              Difference]: Finished difference Result 76 states and 96 transitions.
[2025-04-28 21:21:38,784 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:38,784 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 55
[2025-04-28 21:21:38,785 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,786 INFO  L225             Difference]: With dead ends: 76
[2025-04-28 21:21:38,786 INFO  L226             Difference]: Without dead ends: 76
[2025-04-28 21:21:38,786 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:38,787 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,787 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 495 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,788 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2025-04-28 21:21:38,801 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74.
[2025-04-28 21:21:38,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 74 states, 32 states have (on average 1.25) internal successors, (40), 40 states have internal predecessors, (40), 19 states have call successors, (19), 11 states have call predecessors, (19), 22 states have return successors, (34), 22 states have call predecessors, (34), 19 states have call successors, (34)
[2025-04-28 21:21:38,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions.
[2025-04-28 21:21:38,805 INFO  L79                 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 55
[2025-04-28 21:21:38,806 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,806 INFO  L485      AbstractCegarLoop]: Abstraction has 74 states and 93 transitions.
[2025-04-28 21:21:38,806 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14)
[2025-04-28 21:21:38,806 INFO  L278                IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions.
[2025-04-28 21:21:38,807 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-04-28 21:21:38,807 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,807 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,807 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:38,807 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,807 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 1985958116, now seen corresponding path program 1 times
[2025-04-28 21:21:38,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,808 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133326084]
[2025-04-28 21:21:38,808 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-04-28 21:21:38,878 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-04-28 21:21:38,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:39,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,290 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133326084]
[2025-04-28 21:21:39,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133326084] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-04-28 21:21:39,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062254557]
[2025-04-28 21:21:39,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,292 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:39,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,293 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:39,293 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:39,293 INFO  L87              Difference]: Start difference. First operand 74 states and 93 transitions. Second operand  has 11 states, 8 states have (on average 3.125) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15)
[2025-04-28 21:21:39,531 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,531 INFO  L93              Difference]: Finished difference Result 110 states and 139 transitions.
[2025-04-28 21:21:39,531 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:39,532 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 8 states have (on average 3.125) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) Word has length 59
[2025-04-28 21:21:39,533 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,534 INFO  L225             Difference]: With dead ends: 110
[2025-04-28 21:21:39,534 INFO  L226             Difference]: Without dead ends: 110
[2025-04-28 21:21:39,535 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:39,535 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,536 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 530 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:39,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2025-04-28 21:21:39,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78.
[2025-04-28 21:21:39,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 42 states have internal predecessors, (42), 19 states have call successors, (19), 11 states have call predecessors, (19), 24 states have return successors, (38), 24 states have call predecessors, (38), 19 states have call successors, (38)
[2025-04-28 21:21:39,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions.
[2025-04-28 21:21:39,549 INFO  L79                 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 59
[2025-04-28 21:21:39,549 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,549 INFO  L485      AbstractCegarLoop]: Abstraction has 78 states and 99 transitions.
[2025-04-28 21:21:39,549 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 8 states have (on average 3.125) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15)
[2025-04-28 21:21:39,549 INFO  L278                IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions.
[2025-04-28 21:21:39,550 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-04-28 21:21:39,550 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,551 INFO  L218           NwaCegarLoop]: trace histogram [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, 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,551 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:39,551 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,551 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -2075035951, now seen corresponding path program 1 times
[2025-04-28 21:21:39,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,552 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045376778]
[2025-04-28 21:21:39,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,570 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-04-28 21:21:39,595 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-04-28 21:21:39,597 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:39,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,839 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045376778]
[2025-04-28 21:21:39,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045376778] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:39,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999463653]
[2025-04-28 21:21:39,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,840 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:39,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,840 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:39,840 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:39,841 INFO  L87              Difference]: Start difference. First operand 78 states and 99 transitions. Second operand  has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15)
[2025-04-28 21:21:39,974 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,974 INFO  L93              Difference]: Finished difference Result 80 states and 100 transitions.
[2025-04-28 21:21:39,974 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:39,975 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 59
[2025-04-28 21:21:39,975 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,976 INFO  L225             Difference]: With dead ends: 80
[2025-04-28 21:21:39,976 INFO  L226             Difference]: Without dead ends: 80
[2025-04-28 21:21:39,976 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,976 INFO  L437           NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,977 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 384 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,977 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-04-28 21:21:39,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2025-04-28 21:21:39,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 11 states have call predecessors, (19), 25 states have return successors, (38), 25 states have call predecessors, (38), 19 states have call successors, (38)
[2025-04-28 21:21:39,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions.
[2025-04-28 21:21:39,991 INFO  L79                 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 59
[2025-04-28 21:21:39,991 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,991 INFO  L485      AbstractCegarLoop]: Abstraction has 80 states and 100 transitions.
[2025-04-28 21:21:39,992 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15)
[2025-04-28 21:21:39,992 INFO  L278                IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions.
[2025-04-28 21:21:39,996 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-04-28 21:21:39,996 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,996 INFO  L218           NwaCegarLoop]: trace histogram [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, 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,996 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:39,997 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,997 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 1611110654, now seen corresponding path program 1 times
[2025-04-28 21:21:39,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,997 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571131652]
[2025-04-28 21:21:39,997 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-04-28 21:21:40,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-04-28 21:21:40,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-04-28 21:21:40,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,477 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571131652]
[2025-04-28 21:21:40,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571131652] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-04-28 21:21:40,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597727412]
[2025-04-28 21:21:40,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,478 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:40,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,479 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:40,479 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:40,479 INFO  L87              Difference]: Start difference. First operand 80 states and 100 transitions. Second operand  has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16)
[2025-04-28 21:21:40,748 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,748 INFO  L93              Difference]: Finished difference Result 124 states and 156 transitions.
[2025-04-28 21:21:40,749 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:40,749 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) Word has length 63
[2025-04-28 21:21:40,749 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,750 INFO  L225             Difference]: With dead ends: 124
[2025-04-28 21:21:40,750 INFO  L226             Difference]: Without dead ends: 124
[2025-04-28 21:21:40,751 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 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:40,751 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,752 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 562 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:40,752 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2025-04-28 21:21:40,767 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84.
[2025-04-28 21:21:40,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 45 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 27 states have return successors, (42), 27 states have call predecessors, (42), 19 states have call successors, (42)
[2025-04-28 21:21:40,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions.
[2025-04-28 21:21:40,769 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 63
[2025-04-28 21:21:40,769 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,770 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 106 transitions.
[2025-04-28 21:21:40,770 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16)
[2025-04-28 21:21:40,770 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions.
[2025-04-28 21:21:40,771 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-04-28 21:21:40,771 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,772 INFO  L218           NwaCegarLoop]: trace histogram [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, 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,773 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:21:40,773 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,773 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 513048521, now seen corresponding path program 1 times
[2025-04-28 21:21:40,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,774 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967576067]
[2025-04-28 21:21:40,774 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-04-28 21:21:40,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-04-28 21:21:40,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-04-28 21:21:41,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,028 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967576067]
[2025-04-28 21:21:41,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967576067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:41,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:41,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:41,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677092362]
[2025-04-28 21:21:41,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,029 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:41,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:41,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:41,030 INFO  L87              Difference]: Start difference. First operand 84 states and 106 transitions. Second operand  has 7 states, 5 states have (on average 5.2) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:41,137 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,138 INFO  L93              Difference]: Finished difference Result 86 states and 107 transitions.
[2025-04-28 21:21:41,138 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:41,138 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 5.2) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 63
[2025-04-28 21:21:41,139 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,139 INFO  L225             Difference]: With dead ends: 86
[2025-04-28 21:21:41,139 INFO  L226             Difference]: Without dead ends: 86
[2025-04-28 21:21:41,140 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:41,140 INFO  L437           NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,140 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 342 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:41,141 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2025-04-28 21:21:41,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2025-04-28 21:21:41,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 46 states have internal predecessors, (46), 19 states have call successors, (19), 11 states have call predecessors, (19), 28 states have return successors, (42), 28 states have call predecessors, (42), 19 states have call successors, (42)
[2025-04-28 21:21:41,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions.
[2025-04-28 21:21:41,157 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 63
[2025-04-28 21:21:41,157 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,159 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 107 transitions.
[2025-04-28 21:21:41,159 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 5.2) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:41,159 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions.
[2025-04-28 21:21:41,160 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-04-28 21:21:41,160 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,160 INFO  L218           NwaCegarLoop]: trace histogram [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, 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:41,160 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-04-28 21:21:41,161 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,164 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -563828381, now seen corresponding path program 1 times
[2025-04-28 21:21:41,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,165 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648742078]
[2025-04-28 21:21:41,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:41,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-04-28 21:21:41,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-04-28 21:21:41,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:41,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:41,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,383 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648742078]
[2025-04-28 21:21:41,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648742078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:41,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:41,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:41,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710935945]
[2025-04-28 21:21:41,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,383 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:41,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,384 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:41,384 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:41,384 INFO  L87              Difference]: Start difference. First operand 86 states and 107 transitions. Second operand  has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17)
[2025-04-28 21:21:41,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,447 INFO  L93              Difference]: Finished difference Result 64 states and 79 transitions.
[2025-04-28 21:21:41,448 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:41,448 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 67
[2025-04-28 21:21:41,448 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,449 INFO  L225             Difference]: With dead ends: 64
[2025-04-28 21:21:41,449 INFO  L226             Difference]: Without dead ends: 64
[2025-04-28 21:21:41,449 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:41,450 INFO  L437           NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,450 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:41,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2025-04-28 21:21:41,454 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2025-04-28 21:21:41,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 64 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 35 states have internal predecessors, (35), 19 states have call successors, (19), 11 states have call predecessors, (19), 17 states have return successors, (25), 17 states have call predecessors, (25), 19 states have call successors, (25)
[2025-04-28 21:21:41,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions.
[2025-04-28 21:21:41,455 INFO  L79                 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 67
[2025-04-28 21:21:41,455 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,455 INFO  L485      AbstractCegarLoop]: Abstraction has 64 states and 79 transitions.
[2025-04-28 21:21:41,455 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17)
[2025-04-28 21:21:41,455 INFO  L278                IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions.
[2025-04-28 21:21:41,456 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-04-28 21:21:41,456 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,456 INFO  L218           NwaCegarLoop]: trace histogram [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, 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:41,456 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-04-28 21:21:41,456 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,457 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -696143471, now seen corresponding path program 1 times
[2025-04-28 21:21:41,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,457 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347196354]
[2025-04-28 21:21:41,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:41,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,476 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-04-28 21:21:41,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-04-28 21:21:41,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:41,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:41,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,963 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347196354]
[2025-04-28 21:21:41,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347196354] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:41,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:41,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-04-28 21:21:41,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573299356]
[2025-04-28 21:21:41,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,964 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:41,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,965 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:41,965 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:41,965 INFO  L87              Difference]: Start difference. First operand 64 states and 79 transitions. Second operand  has 13 states, 10 states have (on average 2.7) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17)
[2025-04-28 21:21:42,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:42,249 INFO  L93              Difference]: Finished difference Result 94 states and 117 transitions.
[2025-04-28 21:21:42,249 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:42,250 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 2.7) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) Word has length 67
[2025-04-28 21:21:42,250 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:42,251 INFO  L225             Difference]: With dead ends: 94
[2025-04-28 21:21:42,251 INFO  L226             Difference]: Without dead ends: 94
[2025-04-28 21:21:42,251 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:42,252 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:42,252 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 591 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:42,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-04-28 21:21:42,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92.
[2025-04-28 21:21:42,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 49 states have internal predecessors, (49), 19 states have call successors, (19), 11 states have call predecessors, (19), 31 states have return successors, (46), 31 states have call predecessors, (46), 19 states have call successors, (46)
[2025-04-28 21:21:42,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions.
[2025-04-28 21:21:42,264 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 67
[2025-04-28 21:21:42,264 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:42,265 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 114 transitions.
[2025-04-28 21:21:42,265 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 2.7) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17)
[2025-04-28 21:21:42,265 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions.
[2025-04-28 21:21:42,267 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-04-28 21:21:42,267 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:42,267 INFO  L218           NwaCegarLoop]: trace histogram [2, 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, 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:42,267 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-04-28 21:21:42,267 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:42,267 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:42,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870669056, now seen corresponding path program 1 times
[2025-04-28 21:21:42,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:42,268 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352944259]
[2025-04-28 21:21:42,268 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:42,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:42,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-04-28 21:21:42,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-04-28 21:21:42,525 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:42,525 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:48,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:48,819 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352944259]
[2025-04-28 21:21:48,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352944259] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:48,819 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749432752]
[2025-04-28 21:21:48,819 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,819 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:48,823 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:48,827 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:48,832 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:48,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-04-28 21:21:49,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-04-28 21:21:49,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,089 INFO  L256         TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 216 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:49,117 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:49,313 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:49,439 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:49,563 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:49,696 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:49,825 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:49,966 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:50,123 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2025-04-28 21:21:50,126 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2025-04-28 21:21:50,449 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2025-04-28 21:21:50,627 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2025-04-28 21:21:50,803 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2025-04-28 21:21:50,990 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2025-04-28 21:21:51,180 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2025-04-28 21:21:51,379 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2025-04-28 21:21:51,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:51,566 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
