/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/nzb-file-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:24,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:24,441 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:24,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:24,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:24,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:24,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:24,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:24,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:24,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:24,468 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:24,469 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:24,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:24,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:24,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:24,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:24,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:24,471 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:24,471 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:24,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:24,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:24,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:24,803 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:24,805 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:24,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl [2025-04-26 16:22:24,806 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl' [2025-04-26 16:22:24,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:24,835 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:24,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:24,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:24,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:24,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,866 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:24,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:24,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:24,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:24,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:24,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:24,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:24,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:24,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:24,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/1) ... [2025-04-26 16:22:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,923 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:24,928 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:24,950 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:24,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:24,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:24,951 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:24,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:24,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:24,951 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:24,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:24,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:24,952 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:24,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:24,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:24,953 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:25,000 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:25,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:25,178 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:25,178 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:25,242 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:25,243 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:25,243 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:25 BoogieIcfgContainer [2025-04-26 16:22:25,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:25,246 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:25,246 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:25,250 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:25,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:25,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:24" (1/2) ... [2025-04-26 16:22:25,251 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@351da432 and model type nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:25, skipping insertion in model container [2025-04-26 16:22:25,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:25,251 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:25" (2/2) ... [2025-04-26 16:22:25,252 INFO L376 chiAutomizerObserver]: Analyzing ICFG nzb-file-trans.wvr.bpl [2025-04-26 16:22:25,300 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:25,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:22:25,346 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-26 16:22:25,348 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:22:25,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:22:25,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2025-04-26 16:22:25,360 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 25 transitions, 68 flow [2025-04-26 16:22:25,368 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:25,368 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:25,368 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:25,368 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:25,368 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:25,368 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:25,368 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:25,368 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:25,369 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:25,427 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:25,428 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:25,428 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:25,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:25,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:25,430 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:25,430 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 109 states, but on-demand construction may add more states [2025-04-26 16:22:25,435 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:25,435 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:25,435 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:25,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:25,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:25,439 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" [2025-04-26 16:22:25,440 INFO L754 eck$LassoCheckResult]: Loop: "[144] L41-->L41: Formula: (let ((.cse5 (not v_break_14_68)) (.cse8 (select v_ends_with_6_21 v_i_13_39)) (.cse1 (not v_break_14_67)) (.cse9 (select v_ends_with_2_17 v_i_13_39))) (let ((.cse0 (not v_break_14_52)) (.cse2 (not .cse9)) (.cse6 (and .cse9 .cse1)) (.cse4 (and .cse8 .cse9)) (.cse3 (not .cse8)) (.cse7 (and .cse8 .cse5))) (and (or (and .cse0 .cse1 (or .cse2 .cse3)) (and (or v_break_14_52 .cse4) v_break_14_67)) .cse0 (or (and (or .cse2 v_break_14_67) .cse1 .cse5) (and (or v_break_14_67 .cse6) v_break_14_68)) (< v_i_13_39 5) (= (+ v_i_13_39 1) v_i_13_38) (= v_result_12_41 (ite .cse7 (+ 1000 v_i_13_39) (ite .cse6 (+ v_i_13_39 (- 1000)) (ite .cse4 0 v_result_12_42)))) (or (and (or .cse3 v_break_14_68) (not v_break_14_51) .cse5) (and (or .cse7 v_break_14_68) v_break_14_51))))) InVars {result_12=v_result_12_42, i_13=v_i_13_39, ends_with_6=v_ends_with_6_21, break_14=v_break_14_52, ends_with_2=v_ends_with_2_17} OutVars{result_12=v_result_12_41, i_13=v_i_13_38, ends_with_6=v_ends_with_6_21, break_14=v_break_14_51, ends_with_2=v_ends_with_2_17} AuxVars[v_break_14_68, v_break_14_67] AssignedVars[result_12, i_13, break_14]" [2025-04-26 16:22:25,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2025-04-26 16:22:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799693234] [2025-04-26 16:22:25,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:25,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:25,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:25,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:25,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2025-04-26 16:22:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372985418] [2025-04-26 16:22:25,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:25,568 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,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:25,574 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,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:25,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2025-04-26 16:22:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:25,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238571886] [2025-04-26 16:22:25,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:25,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:25,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:25,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:25,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:25,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:25,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:26,373 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:26,374 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:26,374 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:26,374 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:26,375 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:26,375 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,375 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:26,375 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:26,375 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:26,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:26,376 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:26,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:26,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:26,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:26,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:26,702 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:26,881 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:26,883 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:26,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,888 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:26,889 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:26,890 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:26,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:26,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:26,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:26,913 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:26,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:22:26,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,922 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:26,924 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:26,926 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:26,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:26,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:26,937 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:22:26,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:26,990 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:26,990 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:27,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:27,131 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:27,132 INFO L437 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,136 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:27,137 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:27,137 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:27,158 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:27,159 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:22:27,159 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:27,159 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2025-04-26 16:22:27,168 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:27,171 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:27,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:27,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:27,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:27,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:27,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:27,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:27,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:27,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:27,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:27,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:27,225 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:27,246 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:27,249 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:27,349 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 341 states and 1282 transitions. Complement of second has 5 states. [2025-04-26 16:22:27,350 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:27,353 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:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 16:22:27,357 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:27,358 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:27,358 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:27,358 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:27,358 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:27,358 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:27,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 1282 transitions. [2025-04-26 16:22:27,367 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2025-04-26 16:22:27,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 211 states and 775 transitions. [2025-04-26 16:22:27,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2025-04-26 16:22:27,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2025-04-26 16:22:27,374 INFO L74 IsDeterministic]: Start isDeterministic. Operand 211 states and 775 transitions. [2025-04-26 16:22:27,374 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:27,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 211 states and 775 transitions. [2025-04-26 16:22:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 775 transitions. [2025-04-26 16:22:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2025-04-26 16:22:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 4.0606060606060606) internal successors, (in total 536), 131 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 536 transitions. [2025-04-26 16:22:27,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 536 transitions. [2025-04-26 16:22:27,404 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 536 transitions. [2025-04-26 16:22:27,405 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:27,405 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 536 transitions. [2025-04-26 16:22:27,409 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:27,409 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:27,409 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:27,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:27,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:27,410 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[146] $Ultimate##0-->L75: Formula: (and (= v_i_16_44 0) (not v_is_null_5_13) (not v_break_17_61) (not v_is_null_9_9)) InVars {is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_9} OutVars{break_17=v_break_17_61, is_null_5=v_is_null_5_13, i_16=v_i_16_44, is_null_9=v_is_null_9_9} AuxVars[] AssignedVars[i_16, break_17]" [2025-04-26 16:22:27,410 INFO L754 eck$LassoCheckResult]: Loop: "[149] L75-->L75: Formula: (let ((.cse2 (not v_break_17_68)) (.cse9 (select v_ends_with_10_21 v_i_16_39)) (.cse8 (select v_ends_with_6_31 v_i_16_39)) (.cse3 (not v_break_17_67))) (let ((.cse0 (and .cse8 .cse3)) (.cse4 (and .cse2 .cse9)) (.cse6 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (and .cse8 .cse9)) (.cse7 (not v_break_17_52))) (and (or (and (or .cse0 v_break_17_67) v_break_17_68) (and (or v_break_17_67 .cse1) .cse2 .cse3)) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_39) (ite .cse0 (+ v_i_16_39 (- 1000)) (ite .cse5 0 v_result_15_42)))) (or (and (or .cse4 v_break_17_68) v_break_17_51) (and .cse2 (or .cse6 v_break_17_68) (not v_break_17_51))) (< v_i_16_39 5) (= (+ v_i_16_39 1) v_i_16_38) (or (and (or .cse6 .cse1) .cse3 .cse7) (and v_break_17_67 (or .cse5 v_break_17_52))) .cse7))) InVars {break_17=v_break_17_52, ends_with_10=v_ends_with_10_21, ends_with_6=v_ends_with_6_31, i_16=v_i_16_39, result_15=v_result_15_42} OutVars{break_17=v_break_17_51, ends_with_10=v_ends_with_10_21, ends_with_6=v_ends_with_6_31, i_16=v_i_16_38, result_15=v_result_15_41} AuxVars[v_break_17_67, v_break_17_68] AssignedVars[i_16, result_15, break_17]" [2025-04-26 16:22:27,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 185774, now seen corresponding path program 1 times [2025-04-26 16:22:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:27,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224711878] [2025-04-26 16:22:27,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:27,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:27,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:27,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:27,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:27,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:27,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:27,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2025-04-26 16:22:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:27,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730964022] [2025-04-26 16:22:27,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:27,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:27,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:27,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:27,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:27,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:27,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:27,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 5759143, now seen corresponding path program 1 times [2025-04-26 16:22:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:27,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646556819] [2025-04-26 16:22:27,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:27,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:27,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:27,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:27,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:27,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:27,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:27,789 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:27,790 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:27,790 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:27,790 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:27,790 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:27,790 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,790 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:27,790 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:27,790 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:27,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:27,790 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:27,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,958 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:28,104 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:28,105 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:28,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,107 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:28,108 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:28,110 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:28,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:28,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:28,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:28,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:28,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,129 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:28,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,131 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:28,133 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:28,134 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:28,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:28,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:28,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:28,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:28,150 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,156 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:28,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,158 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:28,159 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:28,161 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:28,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:28,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:28,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:28,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:28,174 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,179 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:28,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,182 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:28,183 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:28,184 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:28,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:28,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:28,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:28,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:28,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:28,198 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:28,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,206 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:28,207 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:28,209 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:28,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:28,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:28,219 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:22:28,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:28,260 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:28,261 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:28,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:28,383 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:28,383 INFO L437 ModelExtractionUtils]: 44 out of 55 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:22:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,385 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:28,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:22:28,388 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:28,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:22:28,410 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:22:28,410 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:28,411 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -2*i_16 + 9 Supporting invariants [] [2025-04-26 16:22:28,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:22:28,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:28,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:28,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:28,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:28,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:28,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:28,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:28,448 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:28,449 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:28,449 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 536 transitions. cyclomatic complexity: 461 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:28,492 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 536 transitions. cyclomatic complexity: 461. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 411 states and 1655 transitions. Complement of second has 4 states. [2025-04-26 16:22:28,492 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:28,493 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:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-26 16:22:28,493 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:28,493 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,493 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:28,493 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,493 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:28,493 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 1655 transitions. [2025-04-26 16:22:28,498 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2025-04-26 16:22:28,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 243 states and 940 transitions. [2025-04-26 16:22:28,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-04-26 16:22:28,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-04-26 16:22:28,502 INFO L74 IsDeterministic]: Start isDeterministic. Operand 243 states and 940 transitions. [2025-04-26 16:22:28,502 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:28,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243 states and 940 transitions. [2025-04-26 16:22:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 940 transitions. [2025-04-26 16:22:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 157. [2025-04-26 16:22:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 4.159235668789809) internal successors, (in total 653), 156 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 653 transitions. [2025-04-26 16:22:28,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 653 transitions. [2025-04-26 16:22:28,516 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 653 transitions. [2025-04-26 16:22:28,516 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:28,516 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 653 transitions. [2025-04-26 16:22:28,518 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:28,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:28,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:28,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:28,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:28,518 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[160] L136-->$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]" "[163] L137-->$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]" "[151] $Ultimate##0-->L109: Formula: (and (not v_is_null_1_13) (= v_i_19_44 0) (not v_break_20_61) (not v_is_null_9_13)) InVars {is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_13} OutVars{break_20=v_break_20_61, i_19=v_i_19_44, is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_13} AuxVars[] AssignedVars[break_20, i_19]" [2025-04-26 16:22:28,520 INFO L754 eck$LassoCheckResult]: Loop: "[154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_67)) (.cse8 (select v_ends_with_2_27 v_i_19_39)) (.cse2 (not v_break_20_68)) (.cse9 (select v_ends_with_10_35 v_i_19_39))) (let ((.cse1 (not .cse9)) (.cse3 (not v_break_20_52)) (.cse0 (and .cse9 .cse2)) (.cse6 (and .cse9 .cse8)) (.cse7 (and .cse8 .cse5)) (.cse4 (not .cse8))) (and (< v_i_19_39 5) (or (and (or .cse0 v_break_20_68) v_break_20_51) (and (or v_break_20_68 .cse1) (not v_break_20_51) .cse2)) (or (and .cse3 (or .cse1 .cse4) .cse5) (and (or .cse6 v_break_20_52) v_break_20_67)) (= (+ v_i_19_39 1) v_i_19_38) .cse3 (= v_result_18_41 (ite .cse0 (+ 1000 v_i_19_39) (ite .cse7 (+ v_i_19_39 (- 1000)) (ite .cse6 0 v_result_18_42)))) (or (and (or .cse7 v_break_20_67) v_break_20_68) (and (or v_break_20_67 .cse4) .cse2 .cse5))))) InVars {i_19=v_i_19_39, break_20=v_break_20_52, ends_with_10=v_ends_with_10_35, result_18=v_result_18_42, ends_with_2=v_ends_with_2_27} OutVars{i_19=v_i_19_38, break_20=v_break_20_51, ends_with_10=v_ends_with_10_35, result_18=v_result_18_41, ends_with_2=v_ends_with_2_27} AuxVars[v_break_20_68, v_break_20_67] AssignedVars[i_19, break_20, result_18]" [2025-04-26 16:22:28,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash 5759672, now seen corresponding path program 1 times [2025-04-26 16:22:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028207837] [2025-04-26 16:22:28,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:28,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:28,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:28,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 1 times [2025-04-26 16:22:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761762432] [2025-04-26 16:22:28,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:28,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:28,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:28,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:28,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash 178549986, now seen corresponding path program 1 times [2025-04-26 16:22:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971034800] [2025-04-26 16:22:28,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:28,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:28,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:28,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:28,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,984 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:28,984 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:28,985 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:28,985 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:28,985 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:28,985 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,985 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:28,985 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:28,985 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:28,985 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:28,985 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:28,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:28,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:28,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,240 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:29,429 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:29,429 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:29,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:29,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:29,431 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:29,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:22:29,433 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:29,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:29,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:29,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:29,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:29,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:29,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:29,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:29,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:22:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:29,454 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:29,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:22:29,456 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:29,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:29,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:29,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:29,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:29,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:29,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:29,469 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:29,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:22:29,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:29,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:29,476 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:29,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:22:29,479 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:29,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:29,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:29,490 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:22:29,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:29,515 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:22:29,515 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:22:29,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:29,628 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:22:29,628 INFO L437 ModelExtractionUtils]: 45 out of 55 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:29,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:29,630 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:29,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:22:29,631 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:29,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:22:29,654 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 16:22:29,654 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:29,654 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -2*i_19 + 9 Supporting invariants [] [2025-04-26 16:22:29,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:29,662 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:29,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:29,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:29,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:29,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:29,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:29,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:29,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:29,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:29,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:29,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:29,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:29,691 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:29,692 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:29,692 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 653 transitions. cyclomatic complexity: 550 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:29,738 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 653 transitions. cyclomatic complexity: 550. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 329 states and 1307 transitions. Complement of second has 4 states. [2025-04-26 16:22:29,739 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:29,739 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:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 16:22:29,740 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:29,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:29,740 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:22:29,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:29,740 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:29,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:29,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 1307 transitions. [2025-04-26 16:22:29,744 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:29,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2025-04-26 16:22:29,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:29,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:29,745 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:29,745 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:29,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:29,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:29,745 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:29,745 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:29,745 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:29,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:29,745 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:29,750 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:29 BoogieIcfgContainer [2025-04-26 16:22:29,750 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:29,750 INFO L158 Benchmark]: Toolchain (without parser) took 4915.81ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 82.5MB in the beginning and 109.6MB in the end (delta: -27.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2025-04-26 16:22:29,750 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:29,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.79ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 80.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:29,751 INFO L158 Benchmark]: Boogie Preprocessor took 26.70ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 79.3MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:29,751 INFO L158 Benchmark]: RCFGBuilder took 346.88ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 61.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:22:29,751 INFO L158 Benchmark]: BuchiAutomizer took 4503.82ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 60.8MB in the beginning and 109.6MB in the end (delta: -48.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:29,752 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 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.79ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 80.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.70ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 79.3MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 346.88ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 61.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 4503.82ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 60.8MB in the beginning and 109.6MB in the end (delta: -48.8MB). 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 4.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. 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, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital103 mio100 ax100 hnf100 lsp409 ukn16 mio100 lsp100 div100 bol137 ite100 ukn100 eq138 hnf98 smp100 dnf477 smp26 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 238ms VariablesStem: 2 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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_13 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_16 and consists of 3 locations. One deterministic module has affine ranking function -2 * i_19 + 9 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:29,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...