/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/chl/word-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:32,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:32,830 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:32,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:32,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:32,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:32,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:32,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:32,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:32,850 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:32,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:32,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:32,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:32,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:32,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:32,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:32,853 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:32,853 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:33,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:33,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:33,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:33,090 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:33,091 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:33,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl [2025-04-26 16:22:33,093 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl' [2025-04-26 16:22:33,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:33,118 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:33,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:33,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:33,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:33,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,158 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:33,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:33,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:33,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:33,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:33,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:33,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:33,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:33,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:33,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/1) ... [2025-04-26 16:22:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,222 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:33,225 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:33,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:33,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:33,246 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:33,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:33,246 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:33,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:33,246 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:33,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:33,247 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:33,290 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:33,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:33,428 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:33,428 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:33,465 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:33,465 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:33,466 INFO L201 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:33 BoogieIcfgContainer [2025-04-26 16:22:33,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:33,467 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:33,467 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:33,470 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:33,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:33,471 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:33" (1/2) ... [2025-04-26 16:22:33,472 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c2b84d and model type word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:33, skipping insertion in model container [2025-04-26 16:22:33,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:33,472 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:33" (2/2) ... [2025-04-26 16:22:33,473 INFO L376 chiAutomizerObserver]: Analyzing ICFG word-subst.wvr.bpl [2025-04-26 16:22:33,516 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:22:33,554 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-26 16:22:33,555 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:33,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:22:33,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:22:33,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2025-04-26 16:22:33,560 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 25 transitions, 68 flow [2025-04-26 16:22:33,568 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:33,568 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:33,568 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:33,568 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:33,568 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:33,568 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:33,568 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:33,568 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:33,569 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:33,619 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:33,620 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:33,620 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:33,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:33,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:33,622 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:33,622 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 109 states, but on-demand construction may add more states [2025-04-26 16:22:33,630 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:33,630 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:33,630 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:33,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:33,630 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:33,633 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_23) (= v_count_4_9 v_count_1_9) (= v_i_9_24 0)) InVars {count_4=v_count_4_9, count_1=v_count_1_9} OutVars{break_10=v_break_10_23, count_1=v_count_1_9, count_4=v_count_4_9, i_9=v_i_9_24} AuxVars[] AssignedVars[break_10, i_9]" [2025-04-26 16:22:33,633 INFO L754 eck$LassoCheckResult]: Loop: "[120] L38-->L38: Formula: (let ((.cse0 (not v_break_10_18)) (.cse3 (select v_get_3_9 v_i_9_19)) (.cse2 (select v_get_0_9 v_i_9_19))) (and (< v_i_9_19 v_len_2_9) .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (or (not .cse1) v_break_10_18) v_break_10_17) (and (not v_break_10_17) .cse0 .cse1))) (< v_i_9_19 v_len_5_9) (= v_result_11_17 (ite (< .cse2 .cse3) (- 1) (ite (< .cse3 .cse2) 1 v_result_11_18))) (= (+ v_i_9_19 1) v_i_9_18))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, get_0=v_get_0_9, len_2=v_len_2_9, len_5=v_len_5_9, i_9=v_i_9_19, get_3=v_get_3_9} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, get_0=v_get_0_9, len_2=v_len_2_9, len_5=v_len_5_9, i_9=v_i_9_18, get_3=v_get_3_9} AuxVars[] AssignedVars[break_10, result_11, i_9]" [2025-04-26 16:22:33,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 5201, now seen corresponding path program 1 times [2025-04-26 16:22:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122963704] [2025-04-26 16:22:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:33,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:33,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:33,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:33,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:33,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2025-04-26 16:22:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128612858] [2025-04-26 16:22:33,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:33,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:33,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:33,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:33,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash 161351, now seen corresponding path program 1 times [2025-04-26 16:22:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:33,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077031747] [2025-04-26 16:22:33,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:33,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:33,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:33,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:33,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:33,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:33,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:33,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,021 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:34,022 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:34,022 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:34,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:34,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:34,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:34,023 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:34,023 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:34,023 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:34,023 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:34,023 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:34,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:34,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:34,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:34,337 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:34,339 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:34,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:34,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:34,344 INFO L229 MonitoredProcess]: Starting monitored process 2 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:34,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:22:34,347 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:34,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:34,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:34,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:34,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:34,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:34,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:34,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:34,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:22:34,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:34,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:34,384 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:34,386 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:34,387 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:34,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:34,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:34,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:34,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:34,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:34,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:34,402 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:34,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:34,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:34,410 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:34,412 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:34,413 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:34,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:34,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:34,423 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:34,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:34,440 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:34,440 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:34,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:34,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:34,470 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:34,472 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:34,473 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:34,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:34,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:34,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:34,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:34,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:34,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:34,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:34,499 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:22:34,499 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:34,502 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:34,503 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:34,505 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:34,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:34,522 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:34,522 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:34,523 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_5, i_9) = 1*len_5 - 1*i_9 Supporting invariants [] [2025-04-26 16:22:34,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:34,531 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:34,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:34,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:34,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:34,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:34,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:34,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:34,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:34,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:34,610 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:34,671 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:34,677 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:34,778 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 341 states and 1282 transitions. Complement of second has 5 states. [2025-04-26 16:22:34,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 16:22:34,790 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:34,791 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:34,791 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:34,791 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:34,791 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:34,791 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:34,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 1282 transitions. [2025-04-26 16:22:34,812 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2025-04-26 16:22:34,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 211 states and 775 transitions. [2025-04-26 16:22:34,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2025-04-26 16:22:34,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2025-04-26 16:22:34,822 INFO L74 IsDeterministic]: Start isDeterministic. Operand 211 states and 775 transitions. [2025-04-26 16:22:34,822 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:34,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 211 states and 775 transitions. [2025-04-26 16:22:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 775 transitions. [2025-04-26 16:22:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2025-04-26 16:22:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 4.0606060606060606) internal successors, (in total 536), 131 states have internal predecessors, (536), 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:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 536 transitions. [2025-04-26 16:22:34,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 536 transitions. [2025-04-26 16:22:34,846 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 536 transitions. [2025-04-26 16:22:34,846 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:34,846 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 536 transitions. [2025-04-26 16:22:34,848 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:34,848 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:34,848 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:34,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:34,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:34,849 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[136] L121-->$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]" "[121] $Ultimate##0-->L68: Formula: (and (= v_i_12_10 0) (not v_break_13_9) (= v_count_1_11 v_count_7_7)) InVars {count_7=v_count_7_7, count_1=v_count_1_11} OutVars{i_12=v_i_12_10, count_7=v_count_7_7, count_1=v_count_1_11, break_13=v_break_13_9} AuxVars[] AssignedVars[i_12, break_13]" [2025-04-26 16:22:34,849 INFO L754 eck$LassoCheckResult]: Loop: "[124] L68-->L68: Formula: (let ((.cse2 (select v_get_6_9 v_i_12_23)) (.cse3 (select v_get_0_15 v_i_12_23)) (.cse1 (not v_break_13_22))) (and (let ((.cse0 (= .cse2 .cse3))) (or (and .cse0 (not v_break_13_21) .cse1) (and (or v_break_13_22 (not .cse0)) v_break_13_21))) (= (+ v_i_12_23 1) v_i_12_22) (< v_i_12_23 v_len_8_9) (= v_result_14_17 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_14_18))) .cse1 (< v_i_12_23 v_len_2_13))) InVars {get_0=v_get_0_15, result_14=v_result_14_18, len_2=v_len_2_13, i_12=v_i_12_23, break_13=v_break_13_22, get_6=v_get_6_9, len_8=v_len_8_9} OutVars{get_0=v_get_0_15, result_14=v_result_14_17, len_2=v_len_2_13, i_12=v_i_12_22, break_13=v_break_13_21, get_6=v_get_6_9, len_8=v_len_8_9} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 16:22:34,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 161941, now seen corresponding path program 1 times [2025-04-26 16:22:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975683867] [2025-04-26 16:22:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:34,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:34,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:34,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:34,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash 155, now seen corresponding path program 1 times [2025-04-26 16:22:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669107077] [2025-04-26 16:22:34,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:34,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:34,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:34,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:34,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:34,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 5020295, now seen corresponding path program 1 times [2025-04-26 16:22:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:34,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592719390] [2025-04-26 16:22:34,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:34,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:34,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:34,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:34,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:34,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,039 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:35,040 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:35,040 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:35,040 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:35,040 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:35,040 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,040 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:35,040 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:35,040 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:35,040 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:35,040 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:35,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,190 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:35,309 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:35,310 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:35,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,312 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:35,313 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:35,314 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:35,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,327 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,333 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:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,335 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:35,338 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:35,338 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:35,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,356 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:35,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:35,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,364 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:35,366 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:35,367 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:35,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:35,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:35,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:35,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:35,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:35,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:35,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:35,394 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:22:35,394 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,396 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:35,398 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:35,399 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:35,416 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:35,416 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:35,417 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:35,417 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_12, len_8) = -1*i_12 + 1*len_8 Supporting invariants [] [2025-04-26 16:22:35,424 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:35,425 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:35,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:35,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:35,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:35,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:35,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:35,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:35,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:35,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:35,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:35,457 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:35,457 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:35,458 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 536 transitions. cyclomatic complexity: 461 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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:35,518 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 536 transitions. cyclomatic complexity: 461. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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 411 states and 1655 transitions. Complement of second has 4 states. [2025-04-26 16:22:35,519 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:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-26 16:22:35,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:35,519 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:35,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:35,520 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:35,520 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:35,520 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:35,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 1655 transitions. [2025-04-26 16:22:35,527 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2025-04-26 16:22:35,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 243 states and 940 transitions. [2025-04-26 16:22:35,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-04-26 16:22:35,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-04-26 16:22:35,534 INFO L74 IsDeterministic]: Start isDeterministic. Operand 243 states and 940 transitions. [2025-04-26 16:22:35,534 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:35,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243 states and 940 transitions. [2025-04-26 16:22:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 940 transitions. [2025-04-26 16:22:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 157. [2025-04-26 16:22:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 4.159235668789809) internal successors, (in total 653), 156 states have internal predecessors, (653), 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:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 653 transitions. [2025-04-26 16:22:35,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 653 transitions. [2025-04-26 16:22:35,552 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 653 transitions. [2025-04-26 16:22:35,552 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:35,552 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 653 transitions. [2025-04-26 16:22:35,554 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:35,554 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:35,554 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:35,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:35,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:35,555 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[136] L121-->$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]" "[139] L122-->$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]" "[126] $Ultimate##0-->L98: Formula: (and (= v_i_15_10 0) (not v_break_16_9) (= v_count_7_11 v_count_4_11)) InVars {count_7=v_count_7_11, count_4=v_count_4_11} OutVars{count_7=v_count_7_11, i_15=v_i_15_10, count_4=v_count_4_11, break_16=v_break_16_9} AuxVars[] AssignedVars[i_15, break_16]" [2025-04-26 16:22:35,555 INFO L754 eck$LassoCheckResult]: Loop: "[129] L98-->L98: Formula: (let ((.cse1 (not v_break_16_22)) (.cse3 (select v_get_6_15 v_i_15_23)) (.cse2 (select v_get_3_15 v_i_15_23))) (and (< v_i_15_23 v_len_5_13) (= (+ v_i_15_23 1) v_i_15_22) (< v_i_15_23 v_len_8_13) (let ((.cse0 (= .cse2 .cse3))) (or (and (or v_break_16_22 (not .cse0)) v_break_16_21) (and .cse0 .cse1 (not v_break_16_21)))) .cse1 (= v_result_17_17 (ite (< .cse2 .cse3) (- 1) (ite (< .cse3 .cse2) 1 v_result_17_18))))) InVars {i_15=v_i_15_23, result_17=v_result_17_18, len_5=v_len_5_13, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_22, get_3=v_get_3_15} OutVars{i_15=v_i_15_22, result_17=v_result_17_17, len_5=v_len_5_13, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_21, get_3=v_get_3_15} AuxVars[] AssignedVars[i_15, result_17, break_16]" [2025-04-26 16:22:35,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 5020855, now seen corresponding path program 1 times [2025-04-26 16:22:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:35,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627254990] [2025-04-26 16:22:35,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:35,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:35,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:35,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:35,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:35,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2025-04-26 16:22:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:35,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322998447] [2025-04-26 16:22:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:35,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:35,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:35,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:35,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:35,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,597 INFO L85 PathProgramCache]: Analyzing trace with hash 155646634, now seen corresponding path program 1 times [2025-04-26 16:22:35,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:35,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185398579] [2025-04-26 16:22:35,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:35,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:35,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:35,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:35,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:35,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:35,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,768 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:35,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:35,768 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:35,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:35,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:35,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:35,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:35,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:35,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:35,768 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:35,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:35,919 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:36,050 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:36,050 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:36,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,052 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:36,053 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:36,054 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:36,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:36,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:36,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:36,068 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:22:36,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,077 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:36,078 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:36,080 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:36,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:36,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:36,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:36,096 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:36,100 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:36,101 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,103 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:36,104 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:36,105 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:36,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:22:36,122 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:36,122 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:36,122 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_8, i_15) = 1*len_8 - 1*i_15 Supporting invariants [] [2025-04-26 16:22:36,128 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:36,129 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:36,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:36,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:36,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:36,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:36,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:36,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:36,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:36,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:36,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:36,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:36,154 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:36,154 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:36,155 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 653 transitions. cyclomatic complexity: 550 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:36,202 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 653 transitions. cyclomatic complexity: 550. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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 329 states and 1307 transitions. Complement of second has 4 states. [2025-04-26 16:22:36,203 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:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 16:22:36,204 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:36,204 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,204 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:22:36,204 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,204 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:36,204 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 1307 transitions. [2025-04-26 16:22:36,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:36,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2025-04-26 16:22:36,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:36,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:36,211 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:36,211 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:36,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:36,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:36,211 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:36,211 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:36,211 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:36,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:36,211 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:36,218 INFO L201 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:36 BoogieIcfgContainer [2025-04-26 16:22:36,218 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:36,219 INFO L158 Benchmark]: Toolchain (without parser) took 3101.16ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.4MB in the beginning and 58.7MB in the end (delta: 27.7MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2025-04-26 16:22:36,219 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.66ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:36,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.12ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:36,220 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:36,220 INFO L158 Benchmark]: RCFGBuilder took 275.58ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 68.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:22:36,221 INFO L158 Benchmark]: BuchiAutomizer took 2751.88ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 68.3MB in the beginning and 58.7MB in the end (delta: 9.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-04-26 16:22:36,222 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.66ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.12ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 275.58ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 68.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 2751.88ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 68.3MB in the beginning and 58.7MB in the end (delta: 9.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp200 ukn42 mio100 lsp77 div100 bol107 ite100 ukn100 eq155 hnf100 smp100 dnf534 smp10 tf100 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 1 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_9 + len_5 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_12 + len_8 and consists of 3 locations. One deterministic module has affine ranking function -1 * i_15 + len_8 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:22:36,236 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...