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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:45,782 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:45,868 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f021a7e5-3d73-411b-9ea8-f9696b30f19e/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:45,876 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:45,876 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:45,908 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:45,908 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:45,909 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:45,910 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:45,910 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:45,911 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:45,911 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:45,911 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:45,911 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:45,911 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:45,911 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:45,911 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:45,911 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:45,912 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:45,912 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:45,912 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:45,912 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:45,912 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:45,912 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:45,912 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:45,913 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:45,913 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:46,281 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:46,293 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:46,296 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:46,299 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:46,299 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:46,303 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f021a7e5-3d73-411b-9ea8-f9696b30f19e/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-175.smt2
[2025-04-28 21:21:46,304 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:46,313 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:46,795 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f021a7e5-3d73-411b-9ea8-f9696b30f19e/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-175.smt2
[2025-04-28 21:21:46,799 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:46,800 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:46,801 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:46,801 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:46,802 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:46,804 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,841 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46 Unit
[2025-04-28 21:21:46,842 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:46,843 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:46,843 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:46,843 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:46,861 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,861 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,899 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,902 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,918 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,920 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,927 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,932 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,934 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,964 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:46,966 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:46,966 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:46,967 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:46,972 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,974 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:46,991 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,005 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:47,010 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:47,023 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:47,023 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:47,023 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:47,024 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure END_QUERY given in one single declaration
[2025-04-28 21:21:47,024 INFO  L130     BoogieDeclarations]: Found specification of procedure END_QUERY
[2025-04-28 21:21:47,024 INFO  L138     BoogieDeclarations]: Found implementation of procedure END_QUERY
[2025-04-28 21:21:47,024 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration
[2025-04-28 21:21:47,024 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1
[2025-04-28 21:21:47,024 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1
[2025-04-28 21:21:47,024 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration
[2025-04-28 21:21:47,024 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:47,024 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:47,025 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration
[2025-04-28 21:21:47,025 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:47,025 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:47,025 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f given in one single declaration
[2025-04-28 21:21:47,025 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f
[2025-04-28 21:21:47,025 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f
[2025-04-28 21:21:47,025 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration
[2025-04-28 21:21:47,025 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2
[2025-04-28 21:21:47,025 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2
[2025-04-28 21:21:47,025 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration
[2025-04-28 21:21:47,026 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:47,026 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:47,026 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:47,026 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:47,026 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:47,087 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:47,089 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:47,530 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:47,532 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:47,549 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:47,553 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:47,554 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:47 BoogieIcfgContainer
[2025-04-28 21:21:47,554 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:47,556 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:47,557 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:47,562 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:47,562 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:46" (1/3) ...
[2025-04-28 21:21:47,563 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f678104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:47, skipping insertion in model container
[2025-04-28 21:21:47,563 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (2/3) ...
[2025-04-28 21:21:47,563 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f678104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:47, skipping insertion in model container
[2025-04-28 21:21:47,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:47" (3/3) ...
[2025-04-28 21:21:47,565 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:47,583 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:47,585 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 9 procedures, 107 locations, 306 edges, 9 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:47,632 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:47,644 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;@7fd66ed1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:47,644 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:47,649 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 107 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 61 states have internal predecessors, (66), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 40 states have call predecessors, (80), 80 states have call successors, (80)
[2025-04-28 21:21:47,673 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:47,673 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,674 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:47,674 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,680 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,680 INFO  L85        PathProgramCache]: Analyzing trace with hash -1807585384, now seen corresponding path program 1 times
[2025-04-28 21:21:47,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,689 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028806208]
[2025-04-28 21:21:47,690 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,719 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:47,722 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:47,722 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,774 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:47,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,776 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028806208]
[2025-04-28 21:21:47,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028806208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:47,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:47,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-04-28 21:21:47,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876582851]
[2025-04-28 21:21:47,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,792 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-04-28 21:21:47,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-04-28 21:21:47,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:47,832 INFO  L87              Difference]: Start difference. First operand  has 107 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 61 states have internal predecessors, (66), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 40 states have call predecessors, (80), 80 states have call successors, (80) Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:47,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,882 INFO  L93              Difference]: Finished difference Result 91 states and 180 transitions.
[2025-04-28 21:21:47,884 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-04-28 21:21:47,886 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:21:47,887 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,900 INFO  L225             Difference]: With dead ends: 91
[2025-04-28 21:21:47,901 INFO  L226             Difference]: Without dead ends: 91
[2025-04-28 21:21:47,903 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:47,907 INFO  L437           NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,907 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:47,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-04-28 21:21:47,972 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2025-04-28 21:21:47,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 16 states have (on average 3.0) internal successors, (48), 47 states have internal predecessors, (48), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 36 states have call predecessors, (66), 66 states have call successors, (66)
[2025-04-28 21:21:47,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 180 transitions.
[2025-04-28 21:21:47,988 INFO  L79                 Accepts]: Start accepts. Automaton has 91 states and 180 transitions. Word has length 16
[2025-04-28 21:21:47,989 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,989 INFO  L485      AbstractCegarLoop]: Abstraction has 91 states and 180 transitions.
[2025-04-28 21:21:47,989 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:47,989 INFO  L278                IsEmpty]: Start isEmpty. Operand 91 states and 180 transitions.
[2025-04-28 21:21:47,994 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:47,998 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,999 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:47,999 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:47,999 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,000 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -211678845, now seen corresponding path program 1 times
[2025-04-28 21:21:48,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,000 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590633862]
[2025-04-28 21:21:48,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,009 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:48,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:48,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,346 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:48,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:48,347 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590633862]
[2025-04-28 21:21:48,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590633862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:48,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:48,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:48,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082070151]
[2025-04-28 21:21:48,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:48,348 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:48,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:48,349 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:48,350 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:48,351 INFO  L87              Difference]: Start difference. First operand 91 states and 180 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:48,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,539 INFO  L93              Difference]: Finished difference Result 93 states and 190 transitions.
[2025-04-28 21:21:48,539 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:48,540 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:48,540 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,544 INFO  L225             Difference]: With dead ends: 93
[2025-04-28 21:21:48,544 INFO  L226             Difference]: Without dead ends: 93
[2025-04-28 21:21:48,544 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:48,545 INFO  L437           NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,550 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 506 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:48,551 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-04-28 21:21:48,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-04-28 21:21:48,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 48 states have internal predecessors, (49), 66 states have call successors, (66), 8 states have call predecessors, (66), 9 states have return successors, (75), 37 states have call predecessors, (75), 66 states have call successors, (75)
[2025-04-28 21:21:48,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 190 transitions.
[2025-04-28 21:21:48,580 INFO  L79                 Accepts]: Start accepts. Automaton has 93 states and 190 transitions. Word has length 16
[2025-04-28 21:21:48,581 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,581 INFO  L485      AbstractCegarLoop]: Abstraction has 93 states and 190 transitions.
[2025-04-28 21:21:48,581 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:48,581 INFO  L278                IsEmpty]: Start isEmpty. Operand 93 states and 190 transitions.
[2025-04-28 21:21:48,586 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:48,586 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,586 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:48,586 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:48,587 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,587 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,587 INFO  L85        PathProgramCache]: Analyzing trace with hash 1773736246, now seen corresponding path program 1 times
[2025-04-28 21:21:48,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,588 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551555922]
[2025-04-28 21:21:48,588 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:48,609 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:48,609 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,609 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:48,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:48,881 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551555922]
[2025-04-28 21:21:48,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551555922] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:48,882 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796061920]
[2025-04-28 21:21:48,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,882 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:48,885 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:48,890 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,892 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,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:48,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:48,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,976 INFO  L256         TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:48,982 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:49,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:49,098 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:49,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:49,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [796061920] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:49,328 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:49,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13
[2025-04-28 21:21:49,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211513156]
[2025-04-28 21:21:49,328 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,329 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:49,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,329 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:49,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:49,330 INFO  L87              Difference]: Start difference. First operand 93 states and 190 transitions. Second operand  has 13 states, 8 states have (on average 2.5) internal successors, (20), 11 states have internal predecessors, (20), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:51,112 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,112 INFO  L93              Difference]: Finished difference Result 188 states and 727 transitions.
[2025-04-28 21:21:51,113 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2025-04-28 21:21:51,114 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 8 states have (on average 2.5) internal successors, (20), 11 states have internal predecessors, (20), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Word has length 24
[2025-04-28 21:21:51,114 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,126 INFO  L225             Difference]: With dead ends: 188
[2025-04-28 21:21:51,127 INFO  L226             Difference]: Without dead ends: 188
[2025-04-28 21:21:51,128 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:21:51,129 INFO  L437           NwaCegarLoop]: 175 mSDtfsCounter, 9 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,130 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1358 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-04-28 21:21:51,132 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2025-04-28 21:21:51,272 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157.
[2025-04-28 21:21:51,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 31 states have (on average 2.193548387096774) internal successors, (68), 65 states have internal predecessors, (68), 103 states have call successors, (103), 9 states have call predecessors, (103), 22 states have return successors, (360), 84 states have call predecessors, (360), 103 states have call successors, (360)
[2025-04-28 21:21:51,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 531 transitions.
[2025-04-28 21:21:51,282 INFO  L79                 Accepts]: Start accepts. Automaton has 157 states and 531 transitions. Word has length 24
[2025-04-28 21:21:51,282 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,282 INFO  L485      AbstractCegarLoop]: Abstraction has 157 states and 531 transitions.
[2025-04-28 21:21:51,283 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 8 states have (on average 2.5) internal successors, (20), 11 states have internal predecessors, (20), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:51,283 INFO  L278                IsEmpty]: Start isEmpty. Operand 157 states and 531 transitions.
[2025-04-28 21:21:51,295 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:51,296 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,296 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]
[2025-04-28 21:21:51,302 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:51,496 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,497 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,497 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,497 INFO  L85        PathProgramCache]: Analyzing trace with hash -1943877937, now seen corresponding path program 1 times
[2025-04-28 21:21:51,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,498 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910435818]
[2025-04-28 21:21:51,498 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,503 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:51,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:51,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,508 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:51,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,561 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910435818]
[2025-04-28 21:21:51,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910435818] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:51,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629100891]
[2025-04-28 21:21:51,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,562 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:51,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,562 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:51,562 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,563 INFO  L87              Difference]: Start difference. First operand 157 states and 531 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:51,656 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,656 INFO  L93              Difference]: Finished difference Result 171 states and 623 transitions.
[2025-04-28 21:21:51,656 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:51,657 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:51,657 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,665 INFO  L225             Difference]: With dead ends: 171
[2025-04-28 21:21:51,667 INFO  L226             Difference]: Without dead ends: 171
[2025-04-28 21:21:51,667 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,668 INFO  L437           NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,668 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 511 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-04-28 21:21:51,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159.
[2025-04-28 21:21:51,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 159 states, 32 states have (on average 2.15625) internal successors, (69), 66 states have internal predecessors, (69), 103 states have call successors, (103), 9 states have call predecessors, (103), 23 states have return successors, (378), 85 states have call predecessors, (378), 103 states have call successors, (378)
[2025-04-28 21:21:51,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 550 transitions.
[2025-04-28 21:21:51,741 INFO  L79                 Accepts]: Start accepts. Automaton has 159 states and 550 transitions. Word has length 24
[2025-04-28 21:21:51,742 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,742 INFO  L485      AbstractCegarLoop]: Abstraction has 159 states and 550 transitions.
[2025-04-28 21:21:51,742 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:51,742 INFO  L278                IsEmpty]: Start isEmpty. Operand 159 states and 550 transitions.
[2025-04-28 21:21:51,751 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:51,752 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,752 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,752 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:51,753 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,753 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -1541800746, now seen corresponding path program 1 times
[2025-04-28 21:21:51,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,754 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111168549]
[2025-04-28 21:21:51,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,761 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:51,769 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:51,769 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:51,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,844 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111168549]
[2025-04-28 21:21:51,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111168549] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:51,844 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539845011]
[2025-04-28 21:21:51,844 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,847 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:51,849 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:51,853 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:51,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:51,924 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:51,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,926 INFO  L256         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:51,928 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:51,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:51,945 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:51,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [539845011] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:51,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:51,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262610538]
[2025-04-28 21:21:51,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,946 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:51,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,946 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:51,946 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,947 INFO  L87              Difference]: Start difference. First operand 159 states and 550 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:52,153 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,154 INFO  L93              Difference]: Finished difference Result 163 states and 550 transitions.
[2025-04-28 21:21:52,154 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:52,154 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 32
[2025-04-28 21:21:52,154 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,160 INFO  L225             Difference]: With dead ends: 163
[2025-04-28 21:21:52,160 INFO  L226             Difference]: Without dead ends: 163
[2025-04-28 21:21:52,161 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:52,162 INFO  L437           NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,162 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 414 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:52,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 163 states.
[2025-04-28 21:21:52,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155.
[2025-04-28 21:21:52,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 155 states, 32 states have (on average 2.15625) internal successors, (69), 66 states have internal predecessors, (69), 99 states have call successors, (99), 9 states have call predecessors, (99), 23 states have return successors, (337), 81 states have call predecessors, (337), 99 states have call successors, (337)
[2025-04-28 21:21:52,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 505 transitions.
[2025-04-28 21:21:52,218 INFO  L79                 Accepts]: Start accepts. Automaton has 155 states and 505 transitions. Word has length 32
[2025-04-28 21:21:52,218 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,218 INFO  L485      AbstractCegarLoop]: Abstraction has 155 states and 505 transitions.
[2025-04-28 21:21:52,219 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:52,219 INFO  L278                IsEmpty]: Start isEmpty. Operand 155 states and 505 transitions.
[2025-04-28 21:21:52,226 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:52,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,227 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:52,232 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:52,428 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:52,428 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,429 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 1702684825, now seen corresponding path program 1 times
[2025-04-28 21:21:52,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,429 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097004470]
[2025-04-28 21:21:52,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,437 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:52,446 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:52,446 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,446 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:52,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,552 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097004470]
[2025-04-28 21:21:52,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097004470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:52,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:52,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:52,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093537258]
[2025-04-28 21:21:52,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,553 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:52,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,553 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:52,554 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:52,555 INFO  L87              Difference]: Start difference. First operand 155 states and 505 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:52,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,647 INFO  L93              Difference]: Finished difference Result 159 states and 545 transitions.
[2025-04-28 21:21:52,647 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:52,647 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:52,648 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,653 INFO  L225             Difference]: With dead ends: 159
[2025-04-28 21:21:52,654 INFO  L226             Difference]: Without dead ends: 159
[2025-04-28 21:21:52,654 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:52,655 INFO  L437           NwaCegarLoop]: 200 mSDtfsCounter, 1 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,656 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 558 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:52,657 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 159 states.
[2025-04-28 21:21:52,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155.
[2025-04-28 21:21:52,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 155 states, 32 states have (on average 2.15625) internal successors, (69), 66 states have internal predecessors, (69), 99 states have call successors, (99), 9 states have call predecessors, (99), 23 states have return successors, (327), 81 states have call predecessors, (327), 99 states have call successors, (327)
[2025-04-28 21:21:52,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 495 transitions.
[2025-04-28 21:21:52,700 INFO  L79                 Accepts]: Start accepts. Automaton has 155 states and 495 transitions. Word has length 40
[2025-04-28 21:21:52,700 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,700 INFO  L485      AbstractCegarLoop]: Abstraction has 155 states and 495 transitions.
[2025-04-28 21:21:52,700 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:52,701 INFO  L278                IsEmpty]: Start isEmpty. Operand 155 states and 495 transitions.
[2025-04-28 21:21:52,708 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:52,709 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,709 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:52,709 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:52,709 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,709 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 1450334656, now seen corresponding path program 1 times
[2025-04-28 21:21:52,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,710 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727259035]
[2025-04-28 21:21:52,710 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,718 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:52,739 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:52,739 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,739 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:52,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,826 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727259035]
[2025-04-28 21:21:52,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727259035] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:52,826 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616831987]
[2025-04-28 21:21:52,826 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,826 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:52,829 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:52,831 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:52,835 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:52,883 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:52,912 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:52,912 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,912 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,913 INFO  L256         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:52,914 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:52,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:52,939 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:52,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616831987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:52,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:52,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:52,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137519651]
[2025-04-28 21:21:52,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,940 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:52,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,944 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:52,944 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:52,944 INFO  L87              Difference]: Start difference. First operand 155 states and 495 transitions. Second operand  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:53,171 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,171 INFO  L93              Difference]: Finished difference Result 171 states and 573 transitions.
[2025-04-28 21:21:53,171 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:53,172 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32
[2025-04-28 21:21:53,172 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,177 INFO  L225             Difference]: With dead ends: 171
[2025-04-28 21:21:53,177 INFO  L226             Difference]: Without dead ends: 171
[2025-04-28 21:21:53,178 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:53,178 INFO  L437           NwaCegarLoop]: 179 mSDtfsCounter, 7 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,178 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 466 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:53,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-04-28 21:21:53,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169.
[2025-04-28 21:21:53,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169 states, 35 states have (on average 2.257142857142857) internal successors, (79), 74 states have internal predecessors, (79), 108 states have call successors, (108), 10 states have call predecessors, (108), 25 states have return successors, (384), 87 states have call predecessors, (384), 108 states have call successors, (384)
[2025-04-28 21:21:53,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 571 transitions.
[2025-04-28 21:21:53,219 INFO  L79                 Accepts]: Start accepts. Automaton has 169 states and 571 transitions. Word has length 32
[2025-04-28 21:21:53,219 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,219 INFO  L485      AbstractCegarLoop]: Abstraction has 169 states and 571 transitions.
[2025-04-28 21:21:53,219 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:53,219 INFO  L278                IsEmpty]: Start isEmpty. Operand 169 states and 571 transitions.
[2025-04-28 21:21:53,226 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:53,227 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,227 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,232 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:53,427 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,427 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,428 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 1795953772, now seen corresponding path program 2 times
[2025-04-28 21:21:53,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,428 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757962799]
[2025-04-28 21:21:53,428 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:53,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,436 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes.
[2025-04-28 21:21:53,445 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:53,445 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:53,445 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:53,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,660 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757962799]
[2025-04-28 21:21:53,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757962799] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:53,660 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613024981]
[2025-04-28 21:21:53,660 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:53,660 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,663 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,665 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:53,671 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,715 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes.
[2025-04-28 21:21:53,746 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:53,746 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:53,746 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,747 INFO  L256         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,750 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:53,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:53,877 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:54,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:54,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613024981] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:54,478 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:54,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:54,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946288267]
[2025-04-28 21:21:54,478 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,480 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:54,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,480 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:54,481 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:54,481 INFO  L87              Difference]: Start difference. First operand 169 states and 571 transitions. Second operand  has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 9 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (17), 13 states have call predecessors, (17), 9 states have call successors, (17)
[2025-04-28 21:21:57,580 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,580 INFO  L93              Difference]: Finished difference Result 502 states and 4634 transitions.
[2025-04-28 21:21:57,581 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. 
[2025-04-28 21:21:57,581 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 9 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (17), 13 states have call predecessors, (17), 9 states have call successors, (17) Word has length 32
[2025-04-28 21:21:57,581 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,628 INFO  L225             Difference]: With dead ends: 502
[2025-04-28 21:21:57,628 INFO  L226             Difference]: Without dead ends: 502
[2025-04-28 21:21:57,629 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=1841, Unknown=0, NotChecked=0, Total=2162
[2025-04-28 21:21:57,629 INFO  L437           NwaCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,630 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1972 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-04-28 21:21:57,631 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 502 states.
[2025-04-28 21:21:58,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 401.
[2025-04-28 21:21:58,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 401 states, 116 states have (on average 1.5603448275862069) internal successors, (181), 164 states have internal predecessors, (181), 181 states have call successors, (181), 13 states have call predecessors, (181), 103 states have return successors, (3255), 227 states have call predecessors, (3255), 181 states have call successors, (3255)
[2025-04-28 21:21:58,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 3617 transitions.
[2025-04-28 21:21:58,204 INFO  L79                 Accepts]: Start accepts. Automaton has 401 states and 3617 transitions. Word has length 32
[2025-04-28 21:21:58,205 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,205 INFO  L485      AbstractCegarLoop]: Abstraction has 401 states and 3617 transitions.
[2025-04-28 21:21:58,205 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 9 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (17), 13 states have call predecessors, (17), 9 states have call successors, (17)
[2025-04-28 21:21:58,205 INFO  L278                IsEmpty]: Start isEmpty. Operand 401 states and 3617 transitions.
[2025-04-28 21:21:58,231 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2025-04-28 21:21:58,231 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,232 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,237 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:58,435 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,436 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,437 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,437 INFO  L85        PathProgramCache]: Analyzing trace with hash -507220635, now seen corresponding path program 2 times
[2025-04-28 21:21:58,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,437 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494453538]
[2025-04-28 21:21:58,437 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:58,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,445 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes.
[2025-04-28 21:21:58,469 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements.
[2025-04-28 21:21:58,472 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:58,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-04-28 21:21:58,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,843 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494453538]
[2025-04-28 21:21:58,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494453538] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:58,843 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92162080]
[2025-04-28 21:21:58,843 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:58,844 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,847 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:58,849 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:58,852 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:58,904 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes.
[2025-04-28 21:21:58,952 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements.
[2025-04-28 21:21:58,952 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:58,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,954 INFO  L256         TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:58,957 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:59,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-04-28 21:21:59,108 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:59,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-04-28 21:21:59,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [92162080] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:59,944 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:59,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15
[2025-04-28 21:21:59,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936188658]
[2025-04-28 21:21:59,945 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:59,945 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-04-28 21:21:59,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:59,946 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-04-28 21:21:59,946 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:59,946 INFO  L87              Difference]: Start difference. First operand 401 states and 3617 transitions. Second operand  has 15 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 12 states have internal predecessors, (23), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21)
[2025-04-28 21:22:00,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:00,329 INFO  L93              Difference]: Finished difference Result 433 states and 3834 transitions.
[2025-04-28 21:22:00,330 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:22:00,330 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 12 states have internal predecessors, (23), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) Word has length 48
[2025-04-28 21:22:00,330 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:00,373 INFO  L225             Difference]: With dead ends: 433
[2025-04-28 21:22:00,373 INFO  L226             Difference]: Without dead ends: 433
[2025-04-28 21:22:00,373 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:22:00,374 INFO  L437           NwaCegarLoop]: 198 mSDtfsCounter, 4 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:00,374 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1476 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:22:00,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 433 states.
[2025-04-28 21:22:00,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 384.
[2025-04-28 21:22:00,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 384 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 156 states have internal predecessors, (173), 180 states have call successors, (180), 13 states have call predecessors, (180), 95 states have return successors, (2732), 218 states have call predecessors, (2732), 180 states have call successors, (2732)
[2025-04-28 21:22:00,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 3085 transitions.
[2025-04-28 21:22:00,718 INFO  L79                 Accepts]: Start accepts. Automaton has 384 states and 3085 transitions. Word has length 48
[2025-04-28 21:22:00,718 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:00,718 INFO  L485      AbstractCegarLoop]: Abstraction has 384 states and 3085 transitions.
[2025-04-28 21:22:00,719 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 12 states have internal predecessors, (23), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21)
[2025-04-28 21:22:00,719 INFO  L278                IsEmpty]: Start isEmpty. Operand 384 states and 3085 transitions.
[2025-04-28 21:22:00,740 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:22:00,740 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:00,740 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]
[2025-04-28 21:22:00,745 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:22:00,944 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:00,945 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:00,946 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:00,946 INFO  L85        PathProgramCache]: Analyzing trace with hash 945166503, now seen corresponding path program 1 times
[2025-04-28 21:22:00,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:00,946 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631403795]
[2025-04-28 21:22:00,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:00,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:00,951 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:22:00,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:22:00,956 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:00,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,995 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:22:00,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:00,996 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631403795]
[2025-04-28 21:22:00,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631403795] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:00,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:00,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:22:00,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575160876]
[2025-04-28 21:22:00,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:00,996 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:22:00,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:00,997 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:22:00,997 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:00,997 INFO  L87              Difference]: Start difference. First operand 384 states and 3085 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:22:01,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:01,095 INFO  L93              Difference]: Finished difference Result 414 states and 3591 transitions.
[2025-04-28 21:22:01,096 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:22:01,096 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 28
[2025-04-28 21:22:01,096 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:01,122 INFO  L225             Difference]: With dead ends: 414
[2025-04-28 21:22:01,122 INFO  L226             Difference]: Without dead ends: 414
[2025-04-28 21:22:01,122 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:01,123 INFO  L437           NwaCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:01,123 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 502 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:22:01,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2025-04-28 21:22:01,457 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 388.
[2025-04-28 21:22:01,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 388 states, 110 states have (on average 1.5909090909090908) internal successors, (175), 158 states have internal predecessors, (175), 180 states have call successors, (180), 13 states have call predecessors, (180), 97 states have return successors, (2808), 220 states have call predecessors, (2808), 180 states have call successors, (2808)
[2025-04-28 21:22:01,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 3163 transitions.
[2025-04-28 21:22:01,479 INFO  L79                 Accepts]: Start accepts. Automaton has 388 states and 3163 transitions. Word has length 28
[2025-04-28 21:22:01,480 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:01,480 INFO  L485      AbstractCegarLoop]: Abstraction has 388 states and 3163 transitions.
[2025-04-28 21:22:01,480 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:22:01,480 INFO  L278                IsEmpty]: Start isEmpty. Operand 388 states and 3163 transitions.
[2025-04-28 21:22:01,501 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:22:01,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:01,502 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:01,502 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:22:01,502 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:01,502 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:01,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -147692646, now seen corresponding path program 1 times
[2025-04-28 21:22:01,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:01,503 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951923908]
[2025-04-28 21:22:01,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:01,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:01,507 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:22:01,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:22:01,514 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:01,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:01,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:01,630 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951923908]
[2025-04-28 21:22:01,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951923908] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:01,630 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552802657]
[2025-04-28 21:22:01,630 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:01,630 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:01,632 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:01,635 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:01,637 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:22:01,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:22:01,713 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:22:01,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:01,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,715 INFO  L256         TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:01,716 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:01,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:01,747 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:01,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:01,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552802657] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:01,952 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:01,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10
[2025-04-28 21:22:01,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880154543]
[2025-04-28 21:22:01,954 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:01,954 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:22:01,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:01,955 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:22:01,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:22:01,955 INFO  L87              Difference]: Start difference. First operand 388 states and 3163 transitions. Second operand  has 10 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:22:02,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:02,659 INFO  L93              Difference]: Finished difference Result 606 states and 7137 transitions.
[2025-04-28 21:22:02,659 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:02,659 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) Word has length 32
[2025-04-28 21:22:02,659 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:02,714 INFO  L225             Difference]: With dead ends: 606
[2025-04-28 21:22:02,714 INFO  L226             Difference]: Without dead ends: 606
[2025-04-28 21:22:02,714 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:22:02,715 INFO  L437           NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:02,715 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1242 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:22:02,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 606 states.
[2025-04-28 21:22:03,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 556.
[2025-04-28 21:22:03,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 556 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 228 states have internal predecessors, (251), 214 states have call successors, (214), 15 states have call predecessors, (214), 163 states have return successors, (6193), 316 states have call predecessors, (6193), 214 states have call successors, (6193)
[2025-04-28 21:22:03,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 6658 transitions.
[2025-04-28 21:22:03,319 INFO  L79                 Accepts]: Start accepts. Automaton has 556 states and 6658 transitions. Word has length 32
[2025-04-28 21:22:03,320 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:03,320 INFO  L485      AbstractCegarLoop]: Abstraction has 556 states and 6658 transitions.
[2025-04-28 21:22:03,320 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:22:03,320 INFO  L278                IsEmpty]: Start isEmpty. Operand 556 states and 6658 transitions.
[2025-04-28 21:22:03,342 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:22:03,342 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:03,342 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 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]
[2025-04-28 21:22:03,348 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:03,543 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:03,543 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:03,543 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:03,544 INFO  L85        PathProgramCache]: Analyzing trace with hash 338623187, now seen corresponding path program 1 times
[2025-04-28 21:22:03,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:03,544 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950084463]
[2025-04-28 21:22:03,544 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:03,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:03,550 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:22:03,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:03,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:03,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:03,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:22:03,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:03,654 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950084463]
[2025-04-28 21:22:03,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950084463] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:03,654 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254097049]
[2025-04-28 21:22:03,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:03,654 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:03,657 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:03,659 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:03,662 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:22:03,704 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:22:03,731 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:03,731 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:03,731 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:03,734 INFO  L256         TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:03,736 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:03,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:22:03,796 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:04,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:22:04,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254097049] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:04,187 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:04,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-04-28 21:22:04,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200597904]
[2025-04-28 21:22:04,187 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:04,188 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:22:04,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:04,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:22:04,189 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:22:04,189 INFO  L87              Difference]: Start difference. First operand 556 states and 6658 transitions. Second operand  has 10 states, 5 states have (on average 3.6) internal successors, (18), 10 states have internal predecessors, (18), 9 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16)
[2025-04-28 21:22:04,489 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:04,489 INFO  L93              Difference]: Finished difference Result 560 states and 6648 transitions.
[2025-04-28 21:22:04,490 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:22:04,490 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 3.6) internal successors, (18), 10 states have internal predecessors, (18), 9 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Word has length 40
[2025-04-28 21:22:04,490 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:04,560 INFO  L225             Difference]: With dead ends: 560
[2025-04-28 21:22:04,560 INFO  L226             Difference]: Without dead ends: 560
[2025-04-28 21:22:04,560 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:22:04,561 INFO  L437           NwaCegarLoop]: 173 mSDtfsCounter, 3 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:04,561 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1106 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:04,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2025-04-28 21:22:05,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 556.
[2025-04-28 21:22:05,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 556 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 228 states have internal predecessors, (251), 214 states have call successors, (214), 15 states have call predecessors, (214), 163 states have return successors, (6176), 316 states have call predecessors, (6176), 214 states have call successors, (6176)
[2025-04-28 21:22:05,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 6641 transitions.
[2025-04-28 21:22:05,241 INFO  L79                 Accepts]: Start accepts. Automaton has 556 states and 6641 transitions. Word has length 40
[2025-04-28 21:22:05,242 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:05,242 INFO  L485      AbstractCegarLoop]: Abstraction has 556 states and 6641 transitions.
[2025-04-28 21:22:05,242 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 3.6) internal successors, (18), 10 states have internal predecessors, (18), 9 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16)
[2025-04-28 21:22:05,242 INFO  L278                IsEmpty]: Start isEmpty. Operand 556 states and 6641 transitions.
[2025-04-28 21:22:05,259 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:22:05,259 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:05,259 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:05,264 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:22:05,463 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-04-28 21:22:05,464 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:05,464 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:05,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -523282096, now seen corresponding path program 1 times
[2025-04-28 21:22:05,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:05,465 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048703912]
[2025-04-28 21:22:05,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:05,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:05,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:22:05,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:05,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:05,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:05,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:05,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:05,634 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048703912]
[2025-04-28 21:22:05,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048703912] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:05,634 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940302433]
[2025-04-28 21:22:05,634 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:05,634 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:05,637 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:05,639 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:05,642 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:22:05,692 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:22:05,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:05,727 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:05,727 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:05,731 INFO  L256         TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:05,736 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:05,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:05,839 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:06,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:06,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [940302433] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:06,367 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:06,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:22:06,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540050642]
[2025-04-28 21:22:06,368 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:06,368 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:22:06,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:06,369 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:22:06,369 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:22:06,369 INFO  L87              Difference]: Start difference. First operand 556 states and 6641 transitions. Second operand  has 16 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 14 states have internal predecessors, (27), 9 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (20), 13 states have call predecessors, (20), 9 states have call successors, (20)
[2025-04-28 21:22:13,885 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:13,885 INFO  L93              Difference]: Finished difference Result 3481 states and 114989 transitions.
[2025-04-28 21:22:13,885 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. 
[2025-04-28 21:22:13,886 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 14 states have internal predecessors, (27), 9 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (20), 13 states have call predecessors, (20), 9 states have call successors, (20) Word has length 40
[2025-04-28 21:22:13,886 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:15,315 INFO  L225             Difference]: With dead ends: 3481
[2025-04-28 21:22:15,315 INFO  L226             Difference]: Without dead ends: 3481
[2025-04-28 21:22:15,318 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3857 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1606, Invalid=9314, Unknown=0, NotChecked=0, Total=10920
[2025-04-28 21:22:15,318 INFO  L437           NwaCegarLoop]: 190 mSDtfsCounter, 25 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 4383 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 4857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 4383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:15,319 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1639 Invalid, 4857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 4383 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time]
[2025-04-28 21:22:15,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3481 states.
