/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-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:21,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:21,211 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,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:21,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:21,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:21,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:21,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:21,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:21,239 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:21,239 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:21,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:21,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:21,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:21,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:21,241 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:21,241 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:21,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:21,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:21,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:21,462 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:21,463 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:21,463 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-symm.wvr.bpl [2025-04-26 16:22:21,464 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl' [2025-04-26 16:22:21,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:21,479 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:21,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:21,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:21,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:21,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,517 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:21,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:21,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:21,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:21,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:21,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-symm.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 L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-symm.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 L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:21,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:21,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:21,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:21,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/1) ... [2025-04-26 16:22:21,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:21,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:21,571 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,575 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,601 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:21,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:21,602 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:21,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:21,602 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:21,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:21,603 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,636 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:21,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:21,760 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:21,760 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:21,816 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:21,816 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:22:21,817 INFO L201 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:21 BoogieIcfgContainer [2025-04-26 16:22:21,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:21,817 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:21,817 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:21,821 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:21,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:21,822 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:21" (1/2) ... [2025-04-26 16:22:21,823 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@191eb1ae and model type name-comparator-symm.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,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:21,823 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:21" (2/2) ... [2025-04-26 16:22:21,824 INFO L376 chiAutomizerObserver]: Analyzing ICFG name-comparator-symm.wvr.bpl [2025-04-26 16:22:21,870 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:22:21,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:22:21,915 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 16:22:21,918 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:22:21,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 16:22:21,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:22:21,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 16:22:21,925 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 16:22:21,934 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:21,935 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:21,935 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:21,935 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:21,935 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:21,937 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:21,937 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:21,937 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:21,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:21,958 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:22:21,959 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,959 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:21,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:21,963 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:21,963 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 29 states, but on-demand construction may add more states [2025-04-26 16:22:21,964 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:22:21,964 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,964 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:21,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:21,968 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L31: Formula: (let ((.cse0 (= v_name_1_15 v_name_2_15)) (.cse1 (not v_break_6_58))) (and (= v_result_3_18 (ite .cse0 0 v_result_3_19)) (= v_i_4_9 0) .cse1 (or (and (or .cse0 v_break_6_58) v_break_6_22) (and (not v_break_6_22) (not .cse0) .cse1)))) InVars {name_2=v_name_2_15, name_1=v_name_1_15, result_3=v_result_3_19} OutVars{name_2=v_name_2_15, i_4=v_i_4_9, result_3=v_result_3_18, name_1=v_name_1_15, break_6=v_break_6_22} AuxVars[v_break_6_58] AssignedVars[i_4, break_6, result_3]" [2025-04-26 16:22:21,968 INFO L754 eck$LassoCheckResult]: Loop: "[82] L31-->L31: Formula: (let ((.cse4 (= v_name_2_27 v_current_5_16)) (.cse3 (not v_break_6_60))) (let ((.cse0 (not v_break_6_49)) (.cse2 (= v_name_1_23 v_current_5_16)) (.cse1 (and .cse4 .cse3))) (and .cse0 (= v_result_3_40 (ite .cse1 (- 1) (ite .cse2 1 v_result_3_41))) (< v_i_4_30 3) (or (and v_break_6_60 (or v_break_6_49 .cse2)) (and .cse0 (not .cse2) .cse3)) (or (and (or (not .cse4) v_break_6_60) (not v_break_6_48) .cse3) (and v_break_6_48 (or .cse1 v_break_6_60))) (= (select v_nondet_0_5 v_i_4_30) v_current_5_16) (= (+ v_i_4_30 1) v_i_4_29)))) InVars {name_2=v_name_2_27, i_4=v_i_4_30, result_3=v_result_3_41, nondet_0=v_nondet_0_5, name_1=v_name_1_23, break_6=v_break_6_49} OutVars{name_2=v_name_2_27, i_4=v_i_4_29, current_5=v_current_5_16, name_1=v_name_1_23, break_6=v_break_6_48, result_3=v_result_3_40, nondet_0=v_nondet_0_5} AuxVars[v_break_6_60] AssignedVars[i_4, current_5, break_6, result_3]" [2025-04-26 16:22:21,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 3831, now seen corresponding path program 1 times [2025-04-26 16:22:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141675611] [2025-04-26 16:22:21,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:22,029 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,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:22,033 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,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 113, now seen corresponding path program 1 times [2025-04-26 16:22:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942595005] [2025-04-26 16:22:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:22,059 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,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:22,067 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,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 118843, now seen corresponding path program 1 times [2025-04-26 16:22:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:22,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122367489] [2025-04-26 16:22:22,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:22,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:22,084 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,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:22,089 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,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:22,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:22,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:22,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:22,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:22,489 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:22,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:22,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:22,490 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:22,490 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:22,490 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:22,490 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:22,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:22,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:22,730 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:23,080 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:23,082 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:23,085 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,087 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,088 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,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:23,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:23,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:23,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:23,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:23,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:23,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:23,146 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:23,146 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:23,168 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,170 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,174 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:23,197 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,197 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:23,198 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:23,198 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_4) = -2*i_4 + 5 Supporting invariants [] [2025-04-26 16:22:23,205 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,207 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:23,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:23,238 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,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:23,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:23,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,258 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,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:23,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:23,261 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,280 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,282 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 29 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,333 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 29 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 67 states and 149 transitions. Complement of second has 5 states. [2025-04-26 16:22:23,334 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,337 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,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-26 16:22:23,343 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:23,346 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,346 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:23,346 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,346 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:23,346 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 149 transitions. [2025-04-26 16:22:23,351 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:22:23,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 25 states and 58 transitions. [2025-04-26 16:22:23,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-04-26 16:22:23,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-04-26 16:22:23,356 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 58 transitions. [2025-04-26 16:22:23,356 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 58 transitions. [2025-04-26 16:22:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 58 transitions. [2025-04-26 16:22:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-04-26 16:22:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (in total 52), 21 states have internal predecessors, (52), 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,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 52 transitions. [2025-04-26 16:22:23,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 52 transitions. [2025-04-26 16:22:23,376 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 52 transitions. [2025-04-26 16:22:23,376 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:23,376 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 52 transitions. [2025-04-26 16:22:23,376 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:22:23,376 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,377 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:23,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:23,377 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[93] L76-->$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]" "[84] $Ultimate##0-->L57: Formula: (let ((.cse1 (not v_break_10_62)) (.cse0 (= v_name_1_41 v_name_2_41))) (and (or (and (or .cse0 v_break_10_62) v_break_10_52) (and (not v_break_10_52) (not .cse0) .cse1)) (= v_i_8_31 0) .cse1 (= v_result_7_40 (ite .cse0 0 v_result_7_41)))) InVars {name_2=v_name_2_41, name_1=v_name_1_41, result_7=v_result_7_41} OutVars{break_10=v_break_10_52, name_2=v_name_2_41, name_1=v_name_1_41, i_8=v_i_8_31, result_7=v_result_7_40} AuxVars[v_break_10_62] AssignedVars[break_10, result_7, i_8]" [2025-04-26 16:22:23,377 INFO L754 eck$LassoCheckResult]: Loop: "[85] L57-->L57: Formula: (let ((.cse3 (= v_name_1_35 v_current_9_16)) (.cse2 (not v_break_10_64))) (let ((.cse1 (and .cse3 .cse2)) (.cse0 (not v_break_10_39)) (.cse4 (= v_name_2_35 v_current_9_16))) (and .cse0 (or (and v_break_10_38 (or .cse1 v_break_10_64)) (and (not v_break_10_38) .cse2 (or v_break_10_64 (not .cse3)))) (< v_i_8_28 3) (= v_result_7_28 (ite .cse1 (- 1) (ite .cse4 1 v_result_7_29))) (= v_i_8_27 (+ v_i_8_28 1)) (or (and (or v_break_10_39 .cse4) v_break_10_64) (and .cse0 .cse2 (not .cse4))) (= (select v_nondet_0_9 v_i_8_28) v_current_9_16)))) InVars {break_10=v_break_10_39, name_2=v_name_2_35, nondet_0=v_nondet_0_9, name_1=v_name_1_35, i_8=v_i_8_28, result_7=v_result_7_29} OutVars{break_10=v_break_10_38, name_2=v_name_2_35, name_1=v_name_1_35, result_7=v_result_7_28, current_9=v_current_9_16, nondet_0=v_nondet_0_9, i_8=v_i_8_27} AuxVars[v_break_10_64] AssignedVars[break_10, result_7, current_9, i_8]" [2025-04-26 16:22:23,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 119248, now seen corresponding path program 1 times [2025-04-26 16:22:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890609629] [2025-04-26 16:22:23,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:23,382 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,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:23,384 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,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2025-04-26 16:22:23,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051332295] [2025-04-26 16:22:23,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,390 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,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,394 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,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 3696773, now seen corresponding path program 1 times [2025-04-26 16:22:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036209175] [2025-04-26 16:22:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,402 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,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,406 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,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,665 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:23,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:23,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:23,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:23,667 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:23,667 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,667 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:23,667 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:23,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-symm.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:23,667 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:23,667 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:23,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,857 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:24,150 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:24,150 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,153 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:24,162 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:24,163 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,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:24,187 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:24,187 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:22:24,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,190 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,191 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:24,195 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,208 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,208 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:24,208 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:24,208 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_8) = -2*i_8 + 5 Supporting invariants [] [2025-04-26 16:22:24,214 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:24,215 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:24,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:24,232 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,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,246 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,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:24,247 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,248 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 52 transitions. cyclomatic complexity: 38 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,271 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 52 transitions. cyclomatic complexity: 38. 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 42 states and 94 transitions. Complement of second has 4 states. [2025-04-26 16:22:24,272 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,273 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,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 16:22:24,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:24,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:24,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:24,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 94 transitions. [2025-04-26 16:22:24,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:24,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2025-04-26 16:22:24,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:24,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:24,275 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:24,275 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:24,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:24,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:24,275 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:24,275 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:24,275 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:24,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:24,275 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:24,282 INFO L201 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:24 BoogieIcfgContainer [2025-04-26 16:22:24,282 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:24,286 INFO L158 Benchmark]: Toolchain (without parser) took 2803.32ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:24,286 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:24,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.21ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:24,287 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 920.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:24,287 INFO L158 Benchmark]: RCFGBuilder took 267.88ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 68.6MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:22:24,287 INFO L158 Benchmark]: BuchiAutomizer took 2464.84ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 68.5MB in the beginning and 84.4MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:24,288 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.21ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 920.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 267.88ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 68.6MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2464.84ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 68.5MB in the beginning and 84.4MB in the end (delta: -15.9MB). 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 2.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital96 mio100 ax100 hnf100 lsp235 ukn41 mio100 lsp88 div100 bol112 ite100 ukn100 eq179 hnf99 smp100 dnf516 smp27 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 115ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_4 + 5 and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * i_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:24,301 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...