/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/name-comparator-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:21,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:21,203 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:21,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:21,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:21,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:21,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:21,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:21,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:21,226 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:21,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:21,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:21,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:21,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:21,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:21,228 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:21,228 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:21,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:21,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:21,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:21,470 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:21,470 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:21,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl [2025-04-26 16:22:21,472 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl' [2025-04-26 16:22:21,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:21,496 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:21,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:21,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:21,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:21,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,536 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:21,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:21,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:21,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:21,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:21,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:21,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:21,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:21,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:21,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:21,597 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:21,600 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:21,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:21,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:21,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:21,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:21,625 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:21,665 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:21,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:21,792 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:21,792 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:21,848 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:21,848 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:21,848 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:21 BoogieIcfgContainer [2025-04-26 16:22:21,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:21,849 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:21,849 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:21,855 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:21,855 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:21,855 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/2) ... [2025-04-26 16:22:21,856 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f38da9 and model type name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:21, skipping insertion in model container [2025-04-26 16:22:21,856 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:21,856 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:21" (2/2) ... [2025-04-26 16:22:21,857 INFO L376 chiAutomizerObserver]: Analyzing ICFG name-comparator-trans.wvr.bpl [2025-04-26 16:22:21,908 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:21,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:22:21,962 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:22:21,964 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:21,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:22:21,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:22:21,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:22:21,973 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:22:21,984 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:21,984 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:21,985 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:21,985 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:21,985 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:21,985 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:21,985 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:21,985 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:21,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:22,036 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:22,036 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:22,037 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:22,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:22,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:22,040 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:22,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 109 states, but on-demand construction may add more states [2025-04-26 16:22:22,048 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:22,049 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:22,049 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:22,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:22,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:22,055 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" [2025-04-26 16:22:22,056 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-->L36: Formula: (let ((.cse3 (= v_name_2_29 v_current_6_16)) (.cse1 (not v_break_7_64))) (let ((.cse4 (and .cse3 .cse1)) (.cse0 (= v_name_1_25 v_current_6_16)) (.cse2 (not v_break_7_53))) (and (= v_current_6_16 (select v_nondet_0_6 v_i_5_32)) (< v_i_5_32 3) (= v_i_5_31 (+ v_i_5_32 1)) (or (and (or .cse0 v_break_7_53) v_break_7_64) (and (not .cse0) .cse1 .cse2)) (or (and (not v_break_7_52) (or v_break_7_64 (not .cse3)) .cse1) (and (or v_break_7_64 .cse4) v_break_7_52)) (= v_result_4_44 (ite .cse4 (- 1) (ite .cse0 1 v_result_4_45))) .cse2))) InVars {name_2=v_name_2_29, i_5=v_i_5_32, nondet_0=v_nondet_0_6, result_4=v_result_4_45, break_7=v_break_7_53, name_1=v_name_1_25} OutVars{name_2=v_name_2_29, i_5=v_i_5_31, result_4=v_result_4_44, break_7=v_break_7_52, current_6=v_current_6_16, name_1=v_name_1_25, nondet_0=v_nondet_0_6} AuxVars[v_break_7_64] AssignedVars[i_5, result_4, break_7, current_6]" [2025-04-26 16:22:22,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2025-04-26 16:22:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428885640] [2025-04-26 16:22:22,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:22,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:22,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:22,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:22,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-04-26 16:22:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670061110] [2025-04-26 16:22:22,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:22,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:22,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:22,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:22,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2025-04-26 16:22:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438393262] [2025-04-26 16:22:22,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:22,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:22,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:22,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,650 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:22,650 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:22,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:22,651 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:22,651 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:22,651 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:22,651 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:22,651 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:22,651 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:22,651 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:22,651 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:22,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:22,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:22,908 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:23,216 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:23,219 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:23,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:23,222 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:23,223 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:23,224 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:23,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:23,236 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:23,236 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 16:22:23,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:23,376 INFO L402 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2025-04-26 16:22:23,377 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 16:22:23,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:23,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:23,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:23,544 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:23,545 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:23,546 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:23,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:23,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:23,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:23,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:23,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:23,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:23,562 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:23,569 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:23,569 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:22:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:23,573 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:23,575 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:23,576 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:23,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:22:23,592 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:23,592 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:23,593 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2025-04-26 16:22:23,598 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:23,601 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:23,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:23,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:23,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:23,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:23,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:23,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:23,659 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:23,684 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:23,686 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:23,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 275 states and 936 transitions. Complement of second has 5 states. [2025-04-26 16:22:23,779 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:23,782 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:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:22:23,787 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:23,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:23,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:23,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 936 transitions. [2025-04-26 16:22:23,799 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:23,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 163 states and 563 transitions. [2025-04-26 16:22:23,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-04-26 16:22:23,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2025-04-26 16:22:23,806 INFO L74 IsDeterministic]: Start isDeterministic. Operand 163 states and 563 transitions. [2025-04-26 16:22:23,806 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 563 transitions. [2025-04-26 16:22:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 563 transitions. [2025-04-26 16:22:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 132. [2025-04-26 16:22:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 3.5606060606060606) internal successors, (in total 470), 131 states have internal predecessors, (470), 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:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 470 transitions. [2025-04-26 16:22:23,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 470 transitions. [2025-04-26 16:22:23,831 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 470 transitions. [2025-04-26 16:22:23,831 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:23,831 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 470 transitions. [2025-04-26 16:22:23,833 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:23,833 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,833 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:23,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:23,833 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L62: Formula: (let ((.cse0 (= v_name_3_15 v_name_2_39)) (.cse1 (not v_break_11_52))) (and (or (and (not .cse0) (not v_break_11_22) .cse1) (and v_break_11_22 (or .cse0 v_break_11_52))) (= v_i_9_11 0) (= v_result_8_26 (ite .cse0 0 v_result_8_27)) .cse1)) InVars {name_3=v_name_3_15, result_8=v_result_8_27, name_2=v_name_2_39} OutVars{name_3=v_name_3_15, result_8=v_result_8_26, name_2=v_name_2_39, break_11=v_break_11_22, i_9=v_i_9_11} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9]" [2025-04-26 16:22:23,833 INFO L754 eck$LassoCheckResult]: Loop: "[122] L62-->L62: Formula: (let ((.cse1 (not v_break_11_54)) (.cse2 (= v_name_3_25 v_current_10_16))) (let ((.cse0 (and .cse1 .cse2)) (.cse4 (= v_name_2_45 v_current_10_16)) (.cse3 (not v_break_11_43))) (and (= v_i_9_27 (+ v_i_9_28 1)) (< v_i_9_28 3) (or (and (or .cse0 v_break_11_54) v_break_11_42) (and (not v_break_11_42) .cse1 (or (not .cse2) v_break_11_54))) (= v_current_10_16 (select v_nondet_0_12 v_i_9_28)) .cse3 (= v_result_8_42 (ite .cse0 (- 1) (ite .cse4 1 v_result_8_44))) (or (and (or .cse4 v_break_11_43) v_break_11_54) (and .cse1 (not .cse4) .cse3))))) InVars {name_3=v_name_3_25, result_8=v_result_8_44, name_2=v_name_2_45, break_11=v_break_11_43, nondet_0=v_nondet_0_12, i_9=v_i_9_28} OutVars{name_3=v_name_3_25, result_8=v_result_8_42, name_2=v_name_2_45, break_11=v_break_11_42, current_10=v_current_10_16, nondet_0=v_nondet_0_12, i_9=v_i_9_27} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9]" [2025-04-26 16:22:23,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 158964, now seen corresponding path program 1 times [2025-04-26 16:22:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221307515] [2025-04-26 16:22:23,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:23,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:23,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:23,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2025-04-26 16:22:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923030829] [2025-04-26 16:22:23,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:23,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:23,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash 4928006, now seen corresponding path program 1 times [2025-04-26 16:22:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051288682] [2025-04-26 16:22:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:23,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:23,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,141 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:24,141 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:24,141 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:24,141 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:24,141 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:24,141 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,141 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:24,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:24,142 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:24,142 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:24,142 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:24,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,333 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:24,597 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:24,598 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,599 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:24,601 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:24,602 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:24,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,616 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:22:24,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,623 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:24,625 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:24,626 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:24,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:24,650 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:24,651 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,653 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:24,654 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:24,656 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:24,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,676 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:24,676 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:24,676 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 5 Supporting invariants [] [2025-04-26 16:22:24,682 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:24,682 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:24,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,716 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:24,717 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:24,717 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 470 transitions. cyclomatic complexity: 395 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:24,759 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 470 transitions. cyclomatic complexity: 395. 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 363 states and 1358 transitions. Complement of second has 4 states. [2025-04-26 16:22:24,759 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:24,759 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:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-26 16:22:24,760 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:24,760 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,760 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:24,760 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,760 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:24,760 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 1358 transitions. [2025-04-26 16:22:24,765 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:24,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 195 states and 733 transitions. [2025-04-26 16:22:24,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2025-04-26 16:22:24,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-04-26 16:22:24,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 195 states and 733 transitions. [2025-04-26 16:22:24,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:24,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 733 transitions. [2025-04-26 16:22:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 733 transitions. [2025-04-26 16:22:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2025-04-26 16:22:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 3.8089171974522293) internal successors, (in total 598), 156 states have internal predecessors, (598), 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:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 598 transitions. [2025-04-26 16:22:24,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 598 transitions. [2025-04-26 16:22:24,776 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 598 transitions. [2025-04-26 16:22:24,776 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:24,776 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 598 transitions. [2025-04-26 16:22:24,778 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:24,778 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:24,778 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:24,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:24,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:24,780 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[133] L107-->$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]" "[136] L108-->$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]" "[124] $Ultimate##0-->L88: Formula: (let ((.cse1 (not v_break_15_62)) (.cse0 (= v_name_3_43 v_name_1_39))) (and (or (and (or v_break_15_62 .cse0) v_break_15_52) (and (not .cse0) .cse1 (not v_break_15_52))) .cse1 (= v_result_12_40 (ite .cse0 0 v_result_12_41)) (= v_i_13_31 0))) InVars {name_3=v_name_3_43, result_12=v_result_12_41, name_1=v_name_1_39} OutVars{name_3=v_name_3_43, result_12=v_result_12_40, i_13=v_i_13_31, name_1=v_name_1_39, break_15=v_break_15_52} AuxVars[v_break_15_62] AssignedVars[result_12, i_13, break_15]" [2025-04-26 16:22:24,780 INFO L754 eck$LassoCheckResult]: Loop: "[125] L88-->L88: Formula: (let ((.cse1 (not v_break_15_64)) (.cse2 (= v_name_3_37 v_current_14_16))) (let ((.cse3 (and .cse1 .cse2)) (.cse0 (not v_break_15_39)) (.cse4 (= v_name_1_33 v_current_14_16))) (and (< v_i_13_28 3) .cse0 (or (and (not v_break_15_38) .cse1 (or (not .cse2) v_break_15_64)) (and (or v_break_15_64 .cse3) v_break_15_38)) (= v_result_12_28 (ite .cse3 (- 1) (ite .cse4 1 v_result_12_29))) (= (+ v_i_13_28 1) v_i_13_27) (or (and .cse0 (not .cse4) .cse1) (and v_break_15_64 (or v_break_15_39 .cse4))) (= v_current_14_16 (select v_nondet_0_16 v_i_13_28))))) InVars {name_3=v_name_3_37, result_12=v_result_12_29, i_13=v_i_13_28, nondet_0=v_nondet_0_16, name_1=v_name_1_33, break_15=v_break_15_39} OutVars{name_3=v_name_3_37, result_12=v_result_12_28, current_14=v_current_14_16, name_1=v_name_1_33, i_13=v_i_13_27, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_64] AssignedVars[result_12, current_14, i_13, break_15]" [2025-04-26 16:22:24,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 4928504, now seen corresponding path program 1 times [2025-04-26 16:22:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894779024] [2025-04-26 16:22:24,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:24,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:24,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:24,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2025-04-26 16:22:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042625408] [2025-04-26 16:22:24,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:24,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:24,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 152783749, now seen corresponding path program 1 times [2025-04-26 16:22:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359035124] [2025-04-26 16:22:24,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:24,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:24,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:24,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:24,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,073 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:25,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:25,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:25,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:25,074 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:25,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:25,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:25,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:25,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:25,074 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:25,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:25,254 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:25,476 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:25,477 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,479 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:25,479 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:25,480 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:25,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:25,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:25,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:25,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:25,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:25,503 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:22:25,503 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:22:25,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,505 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:25,505 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:25,507 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:25,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:25,523 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:25,523 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:25,524 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 5 Supporting invariants [] [2025-04-26 16:22:25,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:22:25,530 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:25,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:25,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:25,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:25,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:25,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,558 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:25,558 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:25,559 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 598 transitions. cyclomatic complexity: 495 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:25,600 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 598 transitions. cyclomatic complexity: 495. 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 1186 transitions. Complement of second has 4 states. [2025-04-26 16:22:25,600 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:25,601 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:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 16:22:25,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:25,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:22:25,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:25,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 1186 transitions. [2025-04-26 16:22:25,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:25,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2025-04-26 16:22:25,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:25,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:25,605 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:25,606 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:25,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:25,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:25,606 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:25,606 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:25,606 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:25,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:25,606 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:25,613 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:25 BoogieIcfgContainer [2025-04-26 16:22:25,613 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:25,613 INFO L158 Benchmark]: Toolchain (without parser) took 4117.18ms. Allocated memory was 167.8MB in the beginning and 151.0MB in the end (delta: -16.8MB). Free memory was 95.0MB in the beginning and 116.0MB in the end (delta: -21.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,614 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.60ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 92.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,615 INFO L158 Benchmark]: Boogie Preprocessor took 26.86ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:25,615 INFO L158 Benchmark]: RCFGBuilder took 281.33ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 74.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:22:25,615 INFO L158 Benchmark]: BuchiAutomizer took 3764.07ms. Allocated memory was 167.8MB in the beginning and 151.0MB in the end (delta: -16.8MB). Free memory was 74.3MB in the beginning and 116.0MB in the end (delta: -41.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,616 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.29ms. Allocated memory is still 167.8MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.60ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 92.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.86ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 281.33ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 74.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 3764.07ms. Allocated memory was 167.8MB in the beginning and 151.0MB in the end (delta: -16.8MB). Free memory was 74.3MB in the beginning and 116.0MB in the end (delta: -41.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 69 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, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 16 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp218 ukn44 mio100 lsp88 div100 bol112 ite100 ukn100 eq177 hnf99 smp100 dnf454 smp31 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 311ms VariablesStem: 5 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 154 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 -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_9 + 5 and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * i_13 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:25,632 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...