/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:55,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:55,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:22:55,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:55,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:55,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:55,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:55,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:55,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:55,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:55,640 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:55,641 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:55,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:55,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:55,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:55,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:55,642 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:55,642 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:55,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:55,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:55,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:55,892 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:55,893 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:55,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl [2025-04-26 16:22:55,896 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl' [2025-04-26 16:22:55,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:55,921 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:55,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:55,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:55,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:55,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,957 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:55,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:55,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:55,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:55,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:55,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:55,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:55,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:55,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:55,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/1) ... [2025-04-26 16:22:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:56,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:56,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:22:56,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:56,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:56,044 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:56,044 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:56,045 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:22:56,087 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:56,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:56,195 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:56,195 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:56,224 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:56,224 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:22:56,224 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:56 BoogieIcfgContainer [2025-04-26 16:22:56,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:56,226 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:56,226 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:56,231 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:56,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:56,232 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:55" (1/2) ... [2025-04-26 16:22:56,234 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7276e7b5 and model type ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:56, skipping insertion in model container [2025-04-26 16:22:56,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:56,234 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:56" (2/2) ... [2025-04-26 16:22:56,235 INFO L376 chiAutomizerObserver]: Analyzing ICFG ring.wvr.bpl [2025-04-26 16:22:56,288 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:56,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:22:56,344 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-26 16:22:56,346 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:56,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:22:56,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:22:56,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2025-04-26 16:22:56,356 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 39 transitions, 96 flow [2025-04-26 16:22:56,366 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:56,366 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:56,366 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:56,366 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:56,366 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:56,366 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:56,366 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:56,366 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:56,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:56,532 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 875 [2025-04-26 16:22:56,532 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:56,532 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:56,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:56,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:56,535 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:56,535 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1006 states, but on-demand construction may add more states [2025-04-26 16:22:56,584 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 875 [2025-04-26 16:22:56,584 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:56,584 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:56,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:56,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:56,590 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" [2025-04-26 16:22:56,591 INFO L754 eck$LassoCheckResult]: Loop: "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:22:56,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash 4189637, now seen corresponding path program 1 times [2025-04-26 16:22:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:56,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589936029] [2025-04-26 16:22:56,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:56,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:56,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:56,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:56,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:56,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:56,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:56,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 136529203, now seen corresponding path program 1 times [2025-04-26 16:22:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:56,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095040820] [2025-04-26 16:22:56,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:56,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:56,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:56,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:56,693 INFO L85 PathProgramCache]: Analyzing trace with hash 306532847, now seen corresponding path program 1 times [2025-04-26 16:22:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:56,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372721480] [2025-04-26 16:22:56,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:56,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:56,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:56,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:56,779 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-26 16:22:56,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:56,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372721480] [2025-04-26 16:22:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372721480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:56,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:56,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:22:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494034255] [2025-04-26 16:22:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:56,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:56,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:56,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:56,937 INFO L87 Difference]: Start difference. First operand currently 1006 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:57,061 INFO L93 Difference]: Finished difference Result 1362 states and 3975 transitions. [2025-04-26 16:22:57,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 3975 transitions. [2025-04-26 16:22:57,082 INFO L131 ngComponentsAnalysis]: Automaton has 129 accepting balls. 1005 [2025-04-26 16:22:57,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1300 states and 3809 transitions. [2025-04-26 16:22:57,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1300 [2025-04-26 16:22:57,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1300 [2025-04-26 16:22:57,119 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1300 states and 3809 transitions. [2025-04-26 16:22:57,137 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:57,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1300 states and 3809 transitions. [2025-04-26 16:22:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states and 3809 transitions. [2025-04-26 16:22:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1133. [2025-04-26 16:22:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1133 states have (on average 2.9585172109443953) internal successors, (in total 3352), 1132 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3352 transitions. [2025-04-26 16:22:57,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1133 states and 3352 transitions. [2025-04-26 16:22:57,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:57,220 INFO L438 stractBuchiCegarLoop]: Abstraction has 1133 states and 3352 transitions. [2025-04-26 16:22:57,220 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:57,221 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1133 states and 3352 transitions. [2025-04-26 16:22:57,227 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 905 [2025-04-26 16:22:57,227 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:57,227 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:57,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:57,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:57,228 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:22:57,229 INFO L754 eck$LassoCheckResult]: Loop: "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" [2025-04-26 16:22:57,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 129910860, now seen corresponding path program 1 times [2025-04-26 16:22:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921124431] [2025-04-26 16:22:57,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 146071260, now seen corresponding path program 1 times [2025-04-26 16:22:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108276565] [2025-04-26 16:22:57,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2069951119, now seen corresponding path program 1 times [2025-04-26 16:22:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879441328] [2025-04-26 16:22:57,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:57,290 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-26 16:22:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:57,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879441328] [2025-04-26 16:22:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879441328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:57,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:22:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289471457] [2025-04-26 16:22:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:57,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:57,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:57,393 INFO L87 Difference]: Start difference. First operand 1133 states and 3352 transitions. cyclomatic complexity: 2328 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:57,421 INFO L93 Difference]: Finished difference Result 1108 states and 3221 transitions. [2025-04-26 16:22:57,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1108 states and 3221 transitions. [2025-04-26 16:22:57,430 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 770 [2025-04-26 16:22:57,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1108 states to 1108 states and 3221 transitions. [2025-04-26 16:22:57,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1108 [2025-04-26 16:22:57,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1108 [2025-04-26 16:22:57,438 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1108 states and 3221 transitions. [2025-04-26 16:22:57,440 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:57,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1108 states and 3221 transitions. [2025-04-26 16:22:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states and 3221 transitions. [2025-04-26 16:22:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1070. [2025-04-26 16:22:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1070 states have (on average 2.91214953271028) internal successors, (in total 3116), 1069 states have internal predecessors, (3116), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 3116 transitions. [2025-04-26 16:22:57,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1070 states and 3116 transitions. [2025-04-26 16:22:57,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:57,472 INFO L438 stractBuchiCegarLoop]: Abstraction has 1070 states and 3116 transitions. [2025-04-26 16:22:57,472 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:57,473 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1070 states and 3116 transitions. [2025-04-26 16:22:57,478 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 740 [2025-04-26 16:22:57,479 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:57,479 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:57,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:57,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:57,480 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:22:57,480 INFO L754 eck$LassoCheckResult]: Loop: "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:22:57,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1253571215, now seen corresponding path program 1 times [2025-04-26 16:22:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401821255] [2025-04-26 16:22:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:57,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:57,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,487 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:57,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash 154660005, now seen corresponding path program 1 times [2025-04-26 16:22:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449407658] [2025-04-26 16:22:57,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1723620055, now seen corresponding path program 1 times [2025-04-26 16:22:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8863173] [2025-04-26 16:22:57,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:57,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:57,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:57,555 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-26 16:22:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:57,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8863173] [2025-04-26 16:22:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8863173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:22:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933679250] [2025-04-26 16:22:57,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:57,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:57,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:57,656 INFO L87 Difference]: Start difference. First operand 1070 states and 3116 transitions. cyclomatic complexity: 2130 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:57,686 INFO L93 Difference]: Finished difference Result 917 states and 2508 transitions. [2025-04-26 16:22:57,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 917 states and 2508 transitions. [2025-04-26 16:22:57,693 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 510 [2025-04-26 16:22:57,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 917 states to 825 states and 2265 transitions. [2025-04-26 16:22:57,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 825 [2025-04-26 16:22:57,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 825 [2025-04-26 16:22:57,700 INFO L74 IsDeterministic]: Start isDeterministic. Operand 825 states and 2265 transitions. [2025-04-26 16:22:57,701 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:57,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 2265 transitions. [2025-04-26 16:22:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 2265 transitions. [2025-04-26 16:22:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 801. [2025-04-26 16:22:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 801 states have (on average 2.7677902621722845) internal successors, (in total 2217), 800 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 2217 transitions. [2025-04-26 16:22:57,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 801 states and 2217 transitions. [2025-04-26 16:22:57,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:57,722 INFO L438 stractBuchiCegarLoop]: Abstraction has 801 states and 2217 transitions. [2025-04-26 16:22:57,722 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:57,722 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 2217 transitions. [2025-04-26 16:22:57,726 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 510 [2025-04-26 16:22:57,726 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:57,727 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:57,727 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:57,727 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:57,728 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:22:57,728 INFO L754 eck$LassoCheckResult]: Loop: "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:22:57,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1064353581, now seen corresponding path program 1 times [2025-04-26 16:22:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27596506] [2025-04-26 16:22:57,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:22:57,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:22:57,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:22:57,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:22:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 149851770, now seen corresponding path program 2 times [2025-04-26 16:22:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316829935] [2025-04-26 16:22:57,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:57,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:57,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:57,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash -431947544, now seen corresponding path program 1 times [2025-04-26 16:22:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935744040] [2025-04-26 16:22:57,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:57,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:57,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:57,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935744040] [2025-04-26 16:22:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935744040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:22:57,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511889828] [2025-04-26 16:22:57,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:22:57,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:57,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:22:57,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-26 16:22:57,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:57,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:57,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:57,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:57,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:57,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 16:22:57,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511889828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:57,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 16:22:57,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-26 16:22:57,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784294138] [2025-04-26 16:22:57,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:58,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:22:58,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:22:58,009 INFO L87 Difference]: Start difference. First operand 801 states and 2217 transitions. cyclomatic complexity: 1462 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:58,068 INFO L93 Difference]: Finished difference Result 1651 states and 4680 transitions. [2025-04-26 16:22:58,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1651 states and 4680 transitions. [2025-04-26 16:22:58,080 INFO L131 ngComponentsAnalysis]: Automaton has 111 accepting balls. 1170 [2025-04-26 16:22:58,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1651 states to 1511 states and 4293 transitions. [2025-04-26 16:22:58,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1511 [2025-04-26 16:22:58,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1511 [2025-04-26 16:22:58,092 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1511 states and 4293 transitions. [2025-04-26 16:22:58,096 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:58,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1511 states and 4293 transitions. [2025-04-26 16:22:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states and 4293 transitions. [2025-04-26 16:22:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1281. [2025-04-26 16:22:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1281 states have (on average 2.9063231850117095) internal successors, (in total 3723), 1280 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 3723 transitions. [2025-04-26 16:22:58,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1281 states and 3723 transitions. [2025-04-26 16:22:58,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:22:58,134 INFO L438 stractBuchiCegarLoop]: Abstraction has 1281 states and 3723 transitions. [2025-04-26 16:22:58,134 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:22:58,134 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1281 states and 3723 transitions. [2025-04-26 16:22:58,140 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 980 [2025-04-26 16:22:58,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:58,140 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:58,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:58,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:58,142 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:22:58,143 INFO L754 eck$LassoCheckResult]: Loop: "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:22:58,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash -483973402, now seen corresponding path program 1 times [2025-04-26 16:22:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243294588] [2025-04-26 16:22:58,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:22:58,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:22:58,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:22:58,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:22:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash 154660005, now seen corresponding path program 2 times [2025-04-26 16:22:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081647257] [2025-04-26 16:22:58,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:58,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:58,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:58,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1700678880, now seen corresponding path program 1 times [2025-04-26 16:22:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:58,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052977828] [2025-04-26 16:22:58,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:58,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:22:58,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:22:58,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:58,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:22:58,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:22:58,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:58,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:58,499 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:58,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:58,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:58,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:58,499 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:58,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:58,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:58,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:22:58,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:58,500 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:58,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,927 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:58,929 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:58,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:58,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:22:58,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:58,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:22:58,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:58,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:22:58,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:58,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,984 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:22:58,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:22:59,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:22:59,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:22:59,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,060 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:22:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:22:59,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:22:59,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:22:59,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:22:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:22:59,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,136 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:22:59,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,144 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:22:59,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,166 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,175 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:22:59,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,191 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:22:59,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,218 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:22:59,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,227 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:22:59,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,241 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:59,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,262 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:22:59,262 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:59,285 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,295 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:22:59,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,313 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,321 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:22:59,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,340 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:59,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,348 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:22:59,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:59,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:59,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:59,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:59,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:59,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:59,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:59,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:59,380 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:59,381 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:59,403 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:59,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:22:59,406 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:59,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,425 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:59,425 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:59,426 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:22:59,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:59,437 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:59,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:59,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:22:59,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:22:59,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:59,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:59,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:59,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:59,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:59,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:59,509 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-26 16:22:59,512 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:22:59,513 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1281 states and 3723 transitions. cyclomatic complexity: 2515 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:59,608 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1281 states and 3723 transitions. cyclomatic complexity: 2515. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3878 states and 11704 transitions. Complement of second has 5 states. [2025-04-26 16:22:59,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-26 16:22:59,614 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:22:59,614 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,614 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 16:22:59,614 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,614 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 16:22:59,614 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3878 states and 11704 transitions. [2025-04-26 16:22:59,647 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 1225 [2025-04-26 16:22:59,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3878 states to 3126 states and 9542 transitions. [2025-04-26 16:22:59,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2025-04-26 16:22:59,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2289 [2025-04-26 16:22:59,677 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3126 states and 9542 transitions. [2025-04-26 16:22:59,677 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:59,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3126 states and 9542 transitions. [2025-04-26 16:22:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states and 9542 transitions. [2025-04-26 16:22:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2613. [2025-04-26 16:22:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2613 states have (on average 3.093761959433601) internal successors, (in total 8084), 2612 states have internal predecessors, (8084), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 8084 transitions. [2025-04-26 16:22:59,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2613 states and 8084 transitions. [2025-04-26 16:22:59,771 INFO L438 stractBuchiCegarLoop]: Abstraction has 2613 states and 8084 transitions. [2025-04-26 16:22:59,771 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:22:59,771 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2613 states and 8084 transitions. [2025-04-26 16:22:59,787 INFO L131 ngComponentsAnalysis]: Automaton has 108 accepting balls. 1155 [2025-04-26 16:22:59,787 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:59,787 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:59,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:59,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:59,789 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[131] L78-1-->thread3FINAL: Formula: (not v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" [2025-04-26 16:22:59,790 INFO L754 eck$LassoCheckResult]: Loop: "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:22:59,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -84576353, now seen corresponding path program 1 times [2025-04-26 16:22:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:59,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756550554] [2025-04-26 16:22:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:59,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:22:59,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:22:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,928 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-26 16:22:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:59,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756550554] [2025-04-26 16:22:59,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756550554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:59,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:59,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:22:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690699662] [2025-04-26 16:22:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:59,929 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:22:59,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 144501610, now seen corresponding path program 1 times [2025-04-26 16:22:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:59,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308016193] [2025-04-26 16:22:59,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:59,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:59,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:59,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:59,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:59,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:22:59,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:22:59,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:59,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:00,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:23:00,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:23:00,081 INFO L87 Difference]: Start difference. First operand 2613 states and 8084 transitions. cyclomatic complexity: 5684 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (in total 21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:00,268 INFO L93 Difference]: Finished difference Result 4293 states and 12979 transitions. [2025-04-26 16:23:00,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4293 states and 12979 transitions. [2025-04-26 16:23:00,303 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 1715 [2025-04-26 16:23:00,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4293 states to 4293 states and 12979 transitions. [2025-04-26 16:23:00,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2924 [2025-04-26 16:23:00,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2924 [2025-04-26 16:23:00,339 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4293 states and 12979 transitions. [2025-04-26 16:23:00,339 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:00,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4293 states and 12979 transitions. [2025-04-26 16:23:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states and 12979 transitions. [2025-04-26 16:23:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3273. [2025-04-26 16:23:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3273 states have (on average 3.1087687137183013) internal successors, (in total 10175), 3272 states have internal predecessors, (10175), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 10175 transitions. [2025-04-26 16:23:00,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3273 states and 10175 transitions. [2025-04-26 16:23:00,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:23:00,418 INFO L438 stractBuchiCegarLoop]: Abstraction has 3273 states and 10175 transitions. [2025-04-26 16:23:00,418 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:00,418 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3273 states and 10175 transitions. [2025-04-26 16:23:00,430 INFO L131 ngComponentsAnalysis]: Automaton has 153 accepting balls. 1575 [2025-04-26 16:23:00,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:00,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:00,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:00,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:00,432 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[122] L58-1-->thread2FINAL: Formula: (not v_f_1) InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:23:00,432 INFO L754 eck$LassoCheckResult]: Loop: "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:00,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 52805674, now seen corresponding path program 1 times [2025-04-26 16:23:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150497046] [2025-04-26 16:23:00,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:00,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:00,504 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-26 16:23:00,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:00,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150497046] [2025-04-26 16:23:00,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150497046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:00,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:00,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671286711] [2025-04-26 16:23:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:00,505 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:00,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash 140314423, now seen corresponding path program 2 times [2025-04-26 16:23:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625241446] [2025-04-26 16:23:00,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:00,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:23:00,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:23:00,561 INFO L87 Difference]: Start difference. First operand 3273 states and 10175 transitions. cyclomatic complexity: 7160 Second operand has 6 states, 5 states have (on average 4.2) internal successors, (in total 21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:00,663 INFO L93 Difference]: Finished difference Result 3277 states and 9935 transitions. [2025-04-26 16:23:00,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3277 states and 9935 transitions. [2025-04-26 16:23:00,679 INFO L131 ngComponentsAnalysis]: Automaton has 145 accepting balls. 1535 [2025-04-26 16:23:00,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3277 states to 3277 states and 9935 transitions. [2025-04-26 16:23:00,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2514 [2025-04-26 16:23:00,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2514 [2025-04-26 16:23:00,704 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3277 states and 9935 transitions. [2025-04-26 16:23:00,704 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:00,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3277 states and 9935 transitions. [2025-04-26 16:23:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states and 9935 transitions. [2025-04-26 16:23:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3207. [2025-04-26 16:23:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3207 states have (on average 3.0483317742438416) internal successors, (in total 9776), 3206 states have internal predecessors, (9776), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 9776 transitions. [2025-04-26 16:23:00,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3207 states and 9776 transitions. [2025-04-26 16:23:00,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:23:00,770 INFO L438 stractBuchiCegarLoop]: Abstraction has 3207 states and 9776 transitions. [2025-04-26 16:23:00,770 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:00,770 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3207 states and 9776 transitions. [2025-04-26 16:23:00,780 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 1525 [2025-04-26 16:23:00,781 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:00,781 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:00,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:00,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:00,782 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:23:00,782 INFO L754 eck$LassoCheckResult]: Loop: "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" [2025-04-26 16:23:00,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -712514618, now seen corresponding path program 1 times [2025-04-26 16:23:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017332787] [2025-04-26 16:23:00,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:00,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:00,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:00,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:00,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash 158440515, now seen corresponding path program 3 times [2025-04-26 16:23:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999776396] [2025-04-26 16:23:00,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:00,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:00,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:00,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:00,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1015696286, now seen corresponding path program 1 times [2025-04-26 16:23:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:00,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972902682] [2025-04-26 16:23:00,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:00,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:23:00,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:23:00,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:00,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:23:00,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:23:00,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:00,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:00,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:01,272 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:01,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:01,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:01,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:01,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:01,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:01,272 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:01,272 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:23:01,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:01,272 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:01,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:01,756 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:01,756 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:01,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,762 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:01,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,779 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:23:01,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:01,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,809 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,817 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:01,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,835 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:23:01,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,847 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:01,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:23:01,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,876 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:01,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,895 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:23:01,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,905 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:01,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,953 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:01,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,961 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:01,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:01,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:01,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:01,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:01,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:01,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:01,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:01,979 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:01,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:23:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:01,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:01,988 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:01,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:23:01,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:02,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:02,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:02,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:02,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:02,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:02,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:02,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:02,019 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:02,019 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:02,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:02,021 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:02,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:23:02,023 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:02,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:23:02,039 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:02,039 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:02,040 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:23:02,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:23:02,053 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:23:02,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:02,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:02,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:02,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:02,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,121 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-26 16:23:02,122 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:02,122 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3207 states and 9776 transitions. cyclomatic complexity: 6815 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,178 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3207 states and 9776 transitions. cyclomatic complexity: 6815. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5595 states and 16837 transitions. Complement of second has 5 states. [2025-04-26 16:23:02,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-04-26 16:23:02,179 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 28 letters. Loop has 5 letters. [2025-04-26 16:23:02,179 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,179 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:02,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:02,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:02,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:02,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:02,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,247 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-26 16:23:02,247 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:02,247 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3207 states and 9776 transitions. cyclomatic complexity: 6815 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,347 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3207 states and 9776 transitions. cyclomatic complexity: 6815. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8496 states and 25949 transitions. Complement of second has 7 states. [2025-04-26 16:23:02,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:23:02,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 28 letters. Loop has 5 letters. [2025-04-26 16:23:02,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,349 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:02,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:02,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:02,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:02,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:02,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:02,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:02,422 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-26 16:23:02,422 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:02,422 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3207 states and 9776 transitions. cyclomatic complexity: 6815 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,482 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3207 states and 9776 transitions. cyclomatic complexity: 6815. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7821 states and 24632 transitions. Complement of second has 5 states. [2025-04-26 16:23:02,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-04-26 16:23:02,483 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 87 transitions. Stem has 28 letters. Loop has 5 letters. [2025-04-26 16:23:02,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,484 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 87 transitions. Stem has 33 letters. Loop has 5 letters. [2025-04-26 16:23:02,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,484 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 87 transitions. Stem has 28 letters. Loop has 10 letters. [2025-04-26 16:23:02,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:02,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7821 states and 24632 transitions. [2025-04-26 16:23:02,520 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 2510 [2025-04-26 16:23:02,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7821 states to 4735 states and 14977 transitions. [2025-04-26 16:23:02,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2358 [2025-04-26 16:23:02,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3122 [2025-04-26 16:23:02,547 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4735 states and 14977 transitions. [2025-04-26 16:23:02,547 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:02,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4735 states and 14977 transitions. [2025-04-26 16:23:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states and 14977 transitions. [2025-04-26 16:23:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 2860. [2025-04-26 16:23:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2860 states have (on average 3.312937062937063) internal successors, (in total 9475), 2859 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 9475 transitions. [2025-04-26 16:23:02,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2860 states and 9475 transitions. [2025-04-26 16:23:02,626 INFO L438 stractBuchiCegarLoop]: Abstraction has 2860 states and 9475 transitions. [2025-04-26 16:23:02,626 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:02,626 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2860 states and 9475 transitions. [2025-04-26 16:23:02,633 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 1968 [2025-04-26 16:23:02,633 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:02,633 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:02,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:02,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:02,634 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:02,634 INFO L754 eck$LassoCheckResult]: Loop: "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:02,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash 52805675, now seen corresponding path program 1 times [2025-04-26 16:23:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:02,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672526079] [2025-04-26 16:23:02,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:02,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:02,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:02,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:02,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:02,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:02,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 10916002, now seen corresponding path program 2 times [2025-04-26 16:23:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:02,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825354519] [2025-04-26 16:23:02,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:02,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-26 16:23:02,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:02,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:02,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:02,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:02,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:02,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:02,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:02,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 220308556, now seen corresponding path program 1 times [2025-04-26 16:23:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:02,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870287973] [2025-04-26 16:23:02,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:02,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:23:02,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:23:02,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:02,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:02,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:23:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:23:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:02,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:02,996 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:02,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:02,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:02,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:02,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:02,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:02,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:02,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:02,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:23:02,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:02,997 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:02,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,338 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:03,338 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:03,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:03,341 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:03,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:23:03,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:03,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:03,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:03,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:03,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:03,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:03,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:03,359 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:03,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:23:03,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:03,367 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:03,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:23:03,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:03,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:03,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:03,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:03,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:03,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:03,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:03,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:03,392 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:23:03,392 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:03,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:03,394 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:03,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:23:03,396 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:03,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:23:03,415 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:03,415 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:03,415 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:03,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:23:03,428 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:03,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:03,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:03,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:03,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:03,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:03,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:03,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:03,510 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-26 16:23:03,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:03,510 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2860 states and 9475 transitions. cyclomatic complexity: 6741 Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:03,582 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2860 states and 9475 transitions. cyclomatic complexity: 6741. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9484 states and 31926 transitions. Complement of second has 7 states. [2025-04-26 16:23:03,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-26 16:23:03,588 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2025-04-26 16:23:03,589 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:03,589 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 31 letters. Loop has 10 letters. [2025-04-26 16:23:03,589 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:03,589 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 21 letters. Loop has 20 letters. [2025-04-26 16:23:03,589 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:03,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9484 states and 31926 transitions. [2025-04-26 16:23:03,668 INFO L131 ngComponentsAnalysis]: Automaton has 140 accepting balls. 2742 [2025-04-26 16:23:03,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9484 states to 7974 states and 26561 transitions. [2025-04-26 16:23:03,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3222 [2025-04-26 16:23:03,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3617 [2025-04-26 16:23:03,716 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7974 states and 26561 transitions. [2025-04-26 16:23:03,716 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:03,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7974 states and 26561 transitions. [2025-04-26 16:23:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states and 26561 transitions. [2025-04-26 16:23:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 5466. [2025-04-26 16:23:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5466 states, 5466 states have (on average 3.3660812294182216) internal successors, (in total 18399), 5465 states have internal predecessors, (18399), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 18399 transitions. [2025-04-26 16:23:03,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5466 states and 18399 transitions. [2025-04-26 16:23:03,923 INFO L438 stractBuchiCegarLoop]: Abstraction has 5466 states and 18399 transitions. [2025-04-26 16:23:03,923 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:23:03,923 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5466 states and 18399 transitions. [2025-04-26 16:23:03,944 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 2398 [2025-04-26 16:23:03,944 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:03,944 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:03,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:03,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:03,945 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:03,945 INFO L754 eck$LassoCheckResult]: Loop: "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:03,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash -441008457, now seen corresponding path program 2 times [2025-04-26 16:23:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58145016] [2025-04-26 16:23:03,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:03,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:03,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:03,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 10916002, now seen corresponding path program 3 times [2025-04-26 16:23:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211146833] [2025-04-26 16:23:03,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 2 equivalence classes. [2025-04-26 16:23:03,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:03,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:03,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1377756120, now seen corresponding path program 2 times [2025-04-26 16:23:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972828501] [2025-04-26 16:23:03,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-26 16:23:03,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:23:03,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:03,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:23:04,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:23:04,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:04,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:04,408 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:04,408 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:04,408 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:04,408 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:04,408 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:04,408 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,408 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:04,408 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:04,408 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:23:04,408 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:04,408 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:04,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:04,749 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:04,749 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:04,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,754 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:23:04,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,770 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:23:04,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,781 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:23:04,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,798 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:23:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,805 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:23:04,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:23:04,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,828 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:23:04,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,842 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:23:04,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,849 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:23:04,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:23:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,871 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:23:04,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,886 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:23:04,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,893 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:23:04,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:04,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:04,918 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:04,918 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:04,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,920 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:04,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:23:04,923 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:04,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:04,939 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:04,939 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:04,939 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:23:04,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:23:04,948 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:04,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:04,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:04,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:04,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:04,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,029 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-26 16:23:05,029 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:05,029 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5466 states and 18399 transitions. cyclomatic complexity: 13131 Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:05,137 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5466 states and 18399 transitions. cyclomatic complexity: 13131. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9558 states and 32234 transitions. Complement of second has 7 states. [2025-04-26 16:23:05,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 16:23:05,139 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 21 letters. Loop has 10 letters. [2025-04-26 16:23:05,139 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,139 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:05,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:05,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:05,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:05,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:05,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:05,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:05,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:05,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:05,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:05,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,238 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-26 16:23:05,238 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:05,239 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5466 states and 18399 transitions. cyclomatic complexity: 13131 Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:05,416 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5466 states and 18399 transitions. cyclomatic complexity: 13131. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 13177 states and 43618 transitions. Complement of second has 9 states. [2025-04-26 16:23:05,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-26 16:23:05,418 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 21 letters. Loop has 10 letters. [2025-04-26 16:23:05,418 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,418 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:05,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:05,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:23:05,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:23:05,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:05,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:05,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:05,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:05,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:05,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:05,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:05,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,519 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-26 16:23:05,520 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:05,520 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5466 states and 18399 transitions. cyclomatic complexity: 13131 Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:05,683 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5466 states and 18399 transitions. cyclomatic complexity: 13131. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 19168 states and 64397 transitions. Complement of second has 18 states. [2025-04-26 16:23:05,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (in total 31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:23:05,684 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 21 letters. Loop has 10 letters. [2025-04-26 16:23:05,684 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,684 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 31 letters. Loop has 10 letters. [2025-04-26 16:23:05,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 21 letters. Loop has 20 letters. [2025-04-26 16:23:05,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19168 states and 64397 transitions. [2025-04-26 16:23:05,801 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 2107 [2025-04-26 16:23:05,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19168 states to 11779 states and 38643 transitions. [2025-04-26 16:23:05,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3813 [2025-04-26 16:23:05,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4796 [2025-04-26 16:23:05,878 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11779 states and 38643 transitions. [2025-04-26 16:23:05,879 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:05,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11779 states and 38643 transitions. [2025-04-26 16:23:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11779 states and 38643 transitions. [2025-04-26 16:23:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11779 to 4814. [2025-04-26 16:23:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4814 states, 4814 states have (on average 3.3859576235978395) internal successors, (in total 16300), 4813 states have internal predecessors, (16300), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 16300 transitions. [2025-04-26 16:23:06,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4814 states and 16300 transitions. [2025-04-26 16:23:06,007 INFO L438 stractBuchiCegarLoop]: Abstraction has 4814 states and 16300 transitions. [2025-04-26 16:23:06,007 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:23:06,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4814 states and 16300 transitions. [2025-04-26 16:23:06,031 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 1010 [2025-04-26 16:23:06,031 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:06,032 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:06,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:06,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:06,033 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:06,033 INFO L754 eck$LassoCheckResult]: Loop: "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:06,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -230373789, now seen corresponding path program 1 times [2025-04-26 16:23:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994162682] [2025-04-26 16:23:06,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:06,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:06,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:06,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994162682] [2025-04-26 16:23:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994162682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:06,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136746373] [2025-04-26 16:23:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:06,087 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:06,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash 140314423, now seen corresponding path program 3 times [2025-04-26 16:23:06,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661231078] [2025-04-26 16:23:06,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:06,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:06,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:06,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:06,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:06,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:06,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:06,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:06,138 INFO L87 Difference]: Start difference. First operand 4814 states and 16300 transitions. cyclomatic complexity: 11699 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (in total 28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:06,232 INFO L93 Difference]: Finished difference Result 11349 states and 37820 transitions. [2025-04-26 16:23:06,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11349 states and 37820 transitions. [2025-04-26 16:23:06,288 INFO L131 ngComponentsAnalysis]: Automaton has 191 accepting balls. 1515 [2025-04-26 16:23:06,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11349 states to 11089 states and 36900 transitions. [2025-04-26 16:23:06,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3787 [2025-04-26 16:23:06,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3907 [2025-04-26 16:23:06,348 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11089 states and 36900 transitions. [2025-04-26 16:23:06,348 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:06,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11089 states and 36900 transitions. [2025-04-26 16:23:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11089 states and 36900 transitions. [2025-04-26 16:23:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11089 to 8725. [2025-04-26 16:23:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8725 states, 8725 states have (on average 3.3812034383954153) internal successors, (in total 29501), 8724 states have internal predecessors, (29501), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8725 states to 8725 states and 29501 transitions. [2025-04-26 16:23:06,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8725 states and 29501 transitions. [2025-04-26 16:23:06,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:06,505 INFO L438 stractBuchiCegarLoop]: Abstraction has 8725 states and 29501 transitions. [2025-04-26 16:23:06,505 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:23:06,505 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8725 states and 29501 transitions. [2025-04-26 16:23:06,536 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 920 [2025-04-26 16:23:06,536 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:06,536 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:06,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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] [2025-04-26 16:23:06,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:06,538 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:23:06,538 INFO L754 eck$LassoCheckResult]: Loop: "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" [2025-04-26 16:23:06,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash 929511017, now seen corresponding path program 1 times [2025-04-26 16:23:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441568352] [2025-04-26 16:23:06,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:23:06,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:23:06,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:23:06,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:06,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441568352] [2025-04-26 16:23:06,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441568352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:06,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221930933] [2025-04-26 16:23:06,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:06,576 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:23:06,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1924025968, now seen corresponding path program 1 times [2025-04-26 16:23:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:06,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24183293] [2025-04-26 16:23:06,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:06,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:06,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:06,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:06,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:06,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:06,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:06,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:06,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:06,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:06,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:06,710 INFO L87 Difference]: Start difference. First operand 8725 states and 29501 transitions. cyclomatic complexity: 20997 Second operand has 5 states, 5 states have (on average 6.6) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:06,722 INFO L93 Difference]: Finished difference Result 668 states and 1556 transitions. [2025-04-26 16:23:06,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 668 states and 1556 transitions. [2025-04-26 16:23:06,724 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:06,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 668 states to 0 states and 0 transitions. [2025-04-26 16:23:06,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:06,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:06,724 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:06,724 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:06,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:06,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:06,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:06,725 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:06,725 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:23:06,725 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:06,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:06,725 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:06,731 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:06 BoogieIcfgContainer [2025-04-26 16:23:06,731 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:06,731 INFO L158 Benchmark]: Toolchain (without parser) took 10810.65ms. Allocated memory was 159.4MB in the beginning and 415.2MB in the end (delta: 255.9MB). Free memory was 85.9MB in the beginning and 111.7MB in the end (delta: -25.8MB). Peak memory consumption was 230.0MB. Max. memory is 8.0GB. [2025-04-26 16:23:06,731 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.80ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 86.9MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:06,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.27ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:06,732 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:06,732 INFO L158 Benchmark]: RCFGBuilder took 237.16ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 70.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:06,732 INFO L158 Benchmark]: BuchiAutomizer took 10504.80ms. Allocated memory was 159.4MB in the beginning and 415.2MB in the end (delta: 255.9MB). Free memory was 70.4MB in the beginning and 111.7MB in the end (delta: -41.3MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:06,734 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.80ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 86.9MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.27ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 237.16ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 70.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 10504.80ms. Allocated memory was 159.4MB in the beginning and 415.2MB in the end (delta: 255.9MB). Free memory was 70.4MB in the beginning and 111.7MB in the end (delta: -41.3MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 5.9s. Construction of modules took 0.4s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 15774 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 1173 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 665 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 749 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 508 mSDtfsCounter, 749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital161 mio100 ax100 hnf100 lsp79 ukn97 mio100 lsp57 div100 bol103 ite100 ukn100 eq213 hnf88 smp100 dnf129 smp90 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 9 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function N + -1 * i and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 8 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:06,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-26 16:23:06,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...