/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/bb5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:33,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:34,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:34,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:34,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:34,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:34,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:34,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:34,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:34,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:34,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:34,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:34,054 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:34,054 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:34,055 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:34,055 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:34,055 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:34,055 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:34,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:34,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:34,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:34,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:34,057 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:34,057 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:34,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:34,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:34,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:34,299 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:34,300 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:34,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb5.c.bpl [2025-04-26 16:56:34,301 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb5.c.bpl' [2025-04-26 16:56:34,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:34,314 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:34,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:34,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:34,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:34,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,349 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:34,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:34,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:34,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:34,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:34,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:34,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:34,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:34,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:34,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:34,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:34,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:34,427 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:34,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:34,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:34,429 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:56:34,464 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:34,466 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:34,536 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:34,536 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:34,545 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:34,546 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:34,547 INFO L201 PluginConnector]: Adding new model bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:34 BoogieIcfgContainer [2025-04-26 16:56:34,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:34,548 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:34,548 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:34,554 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:34,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:34,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/2) ... [2025-04-26 16:56:34,555 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a588829 and model type bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:34, skipping insertion in model container [2025-04-26 16:56:34,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:34,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:34" (2/2) ... [2025-04-26 16:56:34,557 INFO L376 chiAutomizerObserver]: Analyzing ICFG bb5.c.bpl [2025-04-26 16:56:34,601 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:34,637 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:34,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:34,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 30 transitions, 74 flow [2025-04-26 16:56:34,704 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 16:56:34,705 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-26 16:56:34,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 30 transitions, 74 flow [2025-04-26 16:56:34,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-04-26 16:56:34,713 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 26 transitions, 64 flow [2025-04-26 16:56:34,718 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:34,845 WARN L140 AmpleReduction]: Number of pruned transitions: 55 [2025-04-26 16:56:34,845 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:34,845 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 10 [2025-04-26 16:56:34,845 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:43 [2025-04-26 16:56:34,845 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:46 [2025-04-26 16:56:34,845 WARN L145 AmpleReduction]: Times succ was already a loop node:26 [2025-04-26 16:56:34,845 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:11 [2025-04-26 16:56:34,845 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:34,850 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 100 states, 99 states have (on average 1.6262626262626263) internal successors, (in total 161), 99 states have internal predecessors, (161), 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:56:34,855 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:34,855 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:34,855 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:34,855 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:34,855 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:34,855 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:34,856 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:34,856 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:34,857 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 100 states, 99 states have (on average 1.6262626262626263) internal successors, (in total 161), 99 states have internal predecessors, (161), 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:56:34,872 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 65 [2025-04-26 16:56:34,872 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:34,872 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:34,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:34,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:34,876 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:34,877 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 100 states, 99 states have (on average 1.6262626262626263) internal successors, (in total 161), 99 states have internal predecessors, (161), 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:56:34,880 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 65 [2025-04-26 16:56:34,880 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:34,880 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:34,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:34,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:34,884 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:34,884 INFO L754 eck$LassoCheckResult]: Loop: "[67] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[69] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[71] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:56:34,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2940, now seen corresponding path program 1 times [2025-04-26 16:56:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127043507] [2025-04-26 16:56:34,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:34,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:34,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash 96388, now seen corresponding path program 1 times [2025-04-26 16:56:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000458308] [2025-04-26 16:56:34,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:34,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:34,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:34,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:34,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 87652137, now seen corresponding path program 1 times [2025-04-26 16:56:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843193096] [2025-04-26 16:56:34,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:34,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:34,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:35,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:35,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,116 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,117 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,117 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,117 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,117 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:35,117 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,117 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,118 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,118 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:35,118 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,118 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,189 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,190 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,194 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:56:35,196 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:56:35,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:35,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,218 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:56:35,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,222 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:56:35,223 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:56:35,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:35,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,318 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:35,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:35,324 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,324 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,324 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:35,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:35,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,324 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,363 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,374 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:35,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,377 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:56:35,379 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:56:35,381 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:56:35,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:35,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:35,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:35,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:35,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:35,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:35,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:35,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:35,425 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:35,425 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:35,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,573 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:56:35,574 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:56:35,575 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:35,578 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:56:35,578 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:35,579 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:35,579 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1, x4) = 1*z - 1*x1 - 1*x4 Supporting invariants [] [2025-04-26 16:56:35,584 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:56:35,589 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:35,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,676 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:56:35,692 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:35,694 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 100 states, 99 states have (on average 1.6262626262626263) internal successors, (in total 161), 99 states have internal predecessors, (161), 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:56:35,794 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 100 states, 99 states have (on average 1.6262626262626263) internal successors, (in total 161), 99 states have internal predecessors, (161), 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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 219 states and 373 transitions. Complement of second has 6 states. [2025-04-26 16:56:35,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:56:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:56:35,807 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:56:35,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:35,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:56:35,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 373 transitions. [2025-04-26 16:56:35,819 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 49 [2025-04-26 16:56:35,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 133 states and 229 transitions. [2025-04-26 16:56:35,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:56:35,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2025-04-26 16:56:35,824 INFO L74 IsDeterministic]: Start isDeterministic. Operand 133 states and 229 transitions. [2025-04-26 16:56:35,824 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:35,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 133 states and 229 transitions. [2025-04-26 16:56:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 229 transitions. [2025-04-26 16:56:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2025-04-26 16:56:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.7166666666666666) internal successors, (in total 206), 119 states have internal predecessors, (206), 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:56:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2025-04-26 16:56:35,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 206 transitions. [2025-04-26 16:56:35,844 INFO L438 stractBuchiCegarLoop]: Abstraction has 120 states and 206 transitions. [2025-04-26 16:56:35,844 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:35,844 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 206 transitions. [2025-04-26 16:56:35,845 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 49 [2025-04-26 16:56:35,845 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:35,845 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:35,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:35,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:35,846 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L13-1-->L39: 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]" [2025-04-26 16:56:35,846 INFO L754 eck$LassoCheckResult]: Loop: "[78] L39-->L41: Formula: (< v_x3_5 v_z_6) InVars {x3=v_x3_5, z=v_z_6} OutVars{x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[80] L41-->L39: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:35,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 91231, now seen corresponding path program 1 times [2025-04-26 16:56:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848481601] [2025-04-26 16:56:35,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 16:56:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063663651] [2025-04-26 16:56:35,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash 87675489, now seen corresponding path program 1 times [2025-04-26 16:56:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267199500] [2025-04-26 16:56:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:35,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:35,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:35,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:35,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,882 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:35,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,883 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,883 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,883 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:35,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,883 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,904 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,904 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:35,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,906 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:56:35,909 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:56:35,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:35,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,928 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:56:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,930 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:56:35,931 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:56:35,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:35,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,996 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:36,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:56:36,001 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,001 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,001 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,001 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,001 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:36,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:36,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,001 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,021 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,021 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:36,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,024 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:56:36,025 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:56:36,026 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:56:36,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:36,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:36,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:36,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:36,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:36,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:36,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:36,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:36,041 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:36,041 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,042 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:56:36,043 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:56:36,045 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:36,048 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:56:36,048 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:36,049 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:36,049 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:56:36,054 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:56:36,054 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:36,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,088 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:56:36,088 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:36,089 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 206 transitions. cyclomatic complexity: 110 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 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:56:36,144 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 206 transitions. cyclomatic complexity: 110. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 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 284 states and 530 transitions. Complement of second has 6 states. [2025-04-26 16:56:36,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 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:56:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:56:36,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:36,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:36,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:36,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 530 transitions. [2025-04-26 16:56:36,153 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 37 [2025-04-26 16:56:36,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 169 states and 306 transitions. [2025-04-26 16:56:36,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2025-04-26 16:56:36,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2025-04-26 16:56:36,156 INFO L74 IsDeterministic]: Start isDeterministic. Operand 169 states and 306 transitions. [2025-04-26 16:56:36,156 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:36,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 306 transitions. [2025-04-26 16:56:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 306 transitions. [2025-04-26 16:56:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2025-04-26 16:56:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.8397435897435896) internal successors, (in total 287), 155 states have internal predecessors, (287), 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:56:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 287 transitions. [2025-04-26 16:56:36,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 156 states and 287 transitions. [2025-04-26 16:56:36,164 INFO L438 stractBuchiCegarLoop]: Abstraction has 156 states and 287 transitions. [2025-04-26 16:56:36,164 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:36,164 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 287 transitions. [2025-04-26 16:56:36,165 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 37 [2025-04-26 16:56:36,165 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:36,165 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:36,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:36,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:36,166 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[68] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:36,166 INFO L754 eck$LassoCheckResult]: Loop: "[73] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[75] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[76] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 16:56:36,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 87651144, now seen corresponding path program 1 times [2025-04-26 16:56:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45217008] [2025-04-26 16:56:36,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:36,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:36,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,203 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:56:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:36,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45217008] [2025-04-26 16:56:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45217008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777477818] [2025-04-26 16:56:36,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:36,207 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:36,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 16:56:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131391322] [2025-04-26 16:56:36,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,243 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,244 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:36,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:36,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,244 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,272 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,273 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:36,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,278 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:56:36,279 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:56:36,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:36,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,325 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:56:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,328 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:56:36,329 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:56:36,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:36,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,410 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:36,415 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:56:36,415 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,415 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,415 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,415 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,415 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:36,415 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,415 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,415 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,415 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:36,415 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,415 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,440 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,440 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:36,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,442 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:56:36,443 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:56:36,444 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:56:36,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:36,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:36,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:36,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:36,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:36,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:36,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:36,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:36,460 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:36,460 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,462 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:56:36,463 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:56:36,464 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:36,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:36,467 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:36,467 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:36,467 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z, x5) = -1*x3 + 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:56:36,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:36,475 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:36,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:36,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:36,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,528 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:56:36,528 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:36,528 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 287 transitions. cyclomatic complexity: 157 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:56:36,581 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 287 transitions. cyclomatic complexity: 157. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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 312 states and 611 transitions. Complement of second has 6 states. [2025-04-26 16:56:36,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:56:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:56:36,584 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:36,584 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,584 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:36,584 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,584 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:36,584 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 611 transitions. [2025-04-26 16:56:36,588 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:56:36,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 211 states and 419 transitions. [2025-04-26 16:56:36,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-04-26 16:56:36,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-04-26 16:56:36,592 INFO L74 IsDeterministic]: Start isDeterministic. Operand 211 states and 419 transitions. [2025-04-26 16:56:36,592 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:36,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 211 states and 419 transitions. [2025-04-26 16:56:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 419 transitions. [2025-04-26 16:56:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2025-04-26 16:56:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 191 states have (on average 2.020942408376963) internal successors, (in total 386), 190 states have internal predecessors, (386), 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:56:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 386 transitions. [2025-04-26 16:56:36,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 191 states and 386 transitions. [2025-04-26 16:56:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:36,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:36,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:36,607 INFO L87 Difference]: Start difference. First operand 191 states and 386 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 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:56:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:36,628 INFO L93 Difference]: Finished difference Result 66 states and 112 transitions. [2025-04-26 16:56:36,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 112 transitions. [2025-04-26 16:56:36,628 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:36,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 112 transitions. [2025-04-26 16:56:36,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 16:56:36,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-04-26 16:56:36,629 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 112 transitions. [2025-04-26 16:56:36,629 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:36,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 112 transitions. [2025-04-26 16:56:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 112 transitions. [2025-04-26 16:56:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-26 16:56:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.696969696969697) internal successors, (in total 112), 65 states have internal predecessors, (112), 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:56:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 112 transitions. [2025-04-26 16:56:36,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 112 transitions. [2025-04-26 16:56:36,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:36,633 INFO L438 stractBuchiCegarLoop]: Abstraction has 66 states and 112 transitions. [2025-04-26 16:56:36,633 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:36,633 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 112 transitions. [2025-04-26 16:56:36,633 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:36,633 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:36,633 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:36,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:36,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:36,634 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[68] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[91] L13-1-->L39: 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]" "[77] L39-->L43: Formula: (<= v_z_7 v_x3_8) InVars {x3=v_x3_8, z=v_z_7} OutVars{x3=v_x3_8, z=v_z_7} AuxVars[] AssignedVars[]" "[79] L43-->L44: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[70] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[72] L29-1-->thread1FINAL: Formula: (<= v_z_1 (+ v_x5_1 v_x3_1)) InVars {x5=v_x5_1, x3=v_x3_1, z=v_z_1} OutVars{x5=v_x5_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[81] L44-->L45-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:56:36,634 INFO L754 eck$LassoCheckResult]: Loop: "[83] L45-1-->L47: Formula: (< v_x1_6 v_z_8) InVars {x1=v_x1_6, z=v_z_8} OutVars{x1=v_x1_6, z=v_z_8} AuxVars[] AssignedVars[]" "[85] L47-->L45-1: Formula: (= v_x1_7 (+ v_x1_8 1)) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:36,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 919284144, now seen corresponding path program 1 times [2025-04-26 16:56:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732590206] [2025-04-26 16:56:36,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:36,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:36,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:36,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:36,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 16:56:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360316395] [2025-04-26 16:56:36,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1331197934, now seen corresponding path program 1 times [2025-04-26 16:56:36,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926927746] [2025-04-26 16:56:36,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:36,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:36,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:36,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:36,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,683 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,683 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,683 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,683 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,684 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:36,684 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,684 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,684 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,684 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:36,684 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,684 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,701 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,701 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:36,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,703 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:36,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:36,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:36,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:36,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,791 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:36,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:36,798 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,798 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,798 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:36,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:36,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,798 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,814 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,814 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:36,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,816 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:36,818 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:56:36,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:36,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:36,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:36,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:36,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:36,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:36,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:36,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:36,835 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:36,835 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:36,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,837 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:36,840 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:36,842 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:36,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:36,844 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:36,844 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:36,844 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:56:36,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:36,850 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:36,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:36,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:36,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,888 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:56:36,889 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:36,889 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 112 transitions. cyclomatic complexity: 57 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:56:36,915 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 112 transitions. cyclomatic complexity: 57. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 87 states and 144 transitions. Complement of second has 6 states. [2025-04-26 16:56:36,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:56:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-26 16:56:36,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:56:36,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:56:36,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:56:36,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 144 transitions. [2025-04-26 16:56:36,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2025-04-26 16:56:36,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:36,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:36,917 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,917 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:36,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,917 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,917 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:36,917 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,917 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:36,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:36,928 INFO L201 PluginConnector]: Adding new model bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:36 BoogieIcfgContainer [2025-04-26 16:56:36,928 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:36,929 INFO L158 Benchmark]: Toolchain (without parser) took 2614.76ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 74.9MB in the end (delta: -241.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,929 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.68ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 72.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,929 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 71.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,929 INFO L158 Benchmark]: RCFGBuilder took 170.79ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 62.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,930 INFO L158 Benchmark]: BuchiAutomizer took 2380.12ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 62.3MB in the beginning and 74.9MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,931 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.16ms. Allocated memory is still 142.6MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.68ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 72.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 71.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 170.79ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 62.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2380.12ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 62.3MB in the beginning and 74.9MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 46 StatesRemovedByMinimization, 3 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 100 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 204ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 214, Number of transitions in reduction automaton: 161, Number of states in reduction automaton: 100, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:36,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...