/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/3_thr/m5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:01,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:01,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:01,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:01,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:01,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:01,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:01,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:01,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:01,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:01,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:01,637 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:01,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:01,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:01,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:01,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:01,638 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:01,638 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:01,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:01,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:01,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:01,878 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:01,878 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:01,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/m5.c.bpl [2025-04-26 16:57:01,879 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/m5.c.bpl' [2025-04-26 16:57:01,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:01,892 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:01,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:01,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:01,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:01,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,926 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:01,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:01,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:01,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:01,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:01,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:01,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:01,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:01,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:01,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/1) ... [2025-04-26 16:57:01,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:01,979 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:57:01,984 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:57:02,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:02,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:02,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:02,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:02,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:02,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:02,001 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:02,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:02,002 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:57:02,033 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:02,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:02,103 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:02,103 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:02,112 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:02,113 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:02,114 INFO L201 PluginConnector]: Adding new model m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:02 BoogieIcfgContainer [2025-04-26 16:57:02,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:02,115 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:02,115 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:02,119 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:02,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:02,119 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:01" (1/2) ... [2025-04-26 16:57:02,121 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5927502d and model type m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:02, skipping insertion in model container [2025-04-26 16:57:02,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:02,121 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:02" (2/2) ... [2025-04-26 16:57:02,122 INFO L376 chiAutomizerObserver]: Analyzing ICFG m5.c.bpl [2025-04-26 16:57:02,170 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:57:02,206 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:02,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:02,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,208 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:57:02,210 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:57:02,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:57:02,289 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:57:02,292 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:57:02,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-26 16:57:02,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:57:02,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:57:02,300 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:57:02,305 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:02,441 WARN L140 AmpleReduction]: Number of pruned transitions: 139 [2025-04-26 16:57:02,441 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:02,441 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 37 [2025-04-26 16:57:02,441 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 16:57:02,441 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:78 [2025-04-26 16:57:02,441 WARN L145 AmpleReduction]: Times succ was already a loop node:70 [2025-04-26 16:57:02,441 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:5 [2025-04-26 16:57:02,441 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:02,443 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 142 states, 141 states have (on average 1.9078014184397163) internal successors, (in total 269), 141 states have internal predecessors, (269), 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:57:02,449 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:02,449 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:02,449 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:02,449 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:02,449 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:02,449 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:02,449 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:02,449 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:02,452 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.9078014184397163) internal successors, (in total 269), 141 states have internal predecessors, (269), 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:57:02,464 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 88 [2025-04-26 16:57:02,465 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,466 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,469 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:02,470 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.9078014184397163) internal successors, (in total 269), 141 states have internal predecessors, (269), 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:57:02,475 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 88 [2025-04-26 16:57:02,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,476 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,482 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:02,482 INFO L754 eck$LassoCheckResult]: Loop: "[55] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:02,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2457, now seen corresponding path program 1 times [2025-04-26 16:57:02,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513967496] [2025-04-26 16:57:02,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2025-04-26 16:57:02,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868556888] [2025-04-26 16:57:02,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2362939, now seen corresponding path program 1 times [2025-04-26 16:57:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247337073] [2025-04-26 16:57:02,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:02,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:02,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:02,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:02,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:02,695 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:02,697 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:02,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:02,697 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:02,697 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:02,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:02,698 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:02,698 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:02,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:02,698 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:02,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,785 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:02,786 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,793 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:57:02,795 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:57:02,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:02,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,818 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:57:02,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,822 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:57:02,824 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:57:02,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:02,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:02,901 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:02,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:57:02,907 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:02,907 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:02,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:02,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:02,908 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:02,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:02,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:02,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:02,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:02,908 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:02,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:02,929 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:02,932 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:02,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,935 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:57:02,935 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:57:02,938 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:57:02,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:02,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:02,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:02,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:02,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:02,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:02,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:02,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:02,963 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:02,964 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:02,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:02,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,970 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:57:02,972 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:57:02,973 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:02,976 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:57:02,977 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:02,977 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:02,977 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:57:02,984 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:57:02,987 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,063 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:57:03,083 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:57:03,084 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 142 states, 141 states have (on average 1.9078014184397163) internal successors, (in total 269), 141 states have internal predecessors, (269), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:03,202 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 142 states, 141 states have (on average 1.9078014184397163) internal successors, (in total 269), 141 states have internal predecessors, (269), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 452 states and 879 transitions. Complement of second has 7 states. [2025-04-26 16:57:03,204 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:57:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:57:03,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:57:03,214 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,214 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:03,214 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,214 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:57:03,214 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 452 states and 879 transitions. [2025-04-26 16:57:03,228 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 104 [2025-04-26 16:57:03,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 452 states to 291 states and 587 transitions. [2025-04-26 16:57:03,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2025-04-26 16:57:03,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2025-04-26 16:57:03,243 INFO L74 IsDeterministic]: Start isDeterministic. Operand 291 states and 587 transitions. [2025-04-26 16:57:03,243 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:03,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 587 transitions. [2025-04-26 16:57:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 587 transitions. [2025-04-26 16:57:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 203. [2025-04-26 16:57:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 203 states have (on average 2.123152709359606) internal successors, (in total 431), 202 states have internal predecessors, (431), 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:57:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 431 transitions. [2025-04-26 16:57:03,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 203 states and 431 transitions. [2025-04-26 16:57:03,280 INFO L438 stractBuchiCegarLoop]: Abstraction has 203 states and 431 transitions. [2025-04-26 16:57:03,280 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:03,280 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 431 transitions. [2025-04-26 16:57:03,283 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 90 [2025-04-26 16:57:03,283 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:03,283 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:03,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:57:03,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:03,284 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:57:03,284 INFO L754 eck$LassoCheckResult]: Loop: "[65] L43-->L45: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[67] L45-->L43: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:03,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2363516, now seen corresponding path program 1 times [2025-04-26 16:57:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155427584] [2025-04-26 16:57:03,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash 3043, now seen corresponding path program 1 times [2025-04-26 16:57:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410974741] [2025-04-26 16:57:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2023626338, now seen corresponding path program 1 times [2025-04-26 16:57:03,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18697691] [2025-04-26 16:57:03,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,342 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,343 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:03,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:03,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,343 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,371 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,371 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:03,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,374 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:57:03,377 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:57:03,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:03,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:57:03,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,397 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:57:03,398 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:57:03,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:03,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,468 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,474 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,474 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,474 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,474 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,474 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,474 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,474 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,474 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,474 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:03,474 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,474 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,500 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,500 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,502 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:57:03,504 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:57:03,505 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:57:03,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,528 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:03,528 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:03,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,530 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:57:03,532 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:57:03,533 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,537 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:57:03,537 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,537 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,537 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 16:57:03,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,600 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:57:03,601 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:57:03,601 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 203 states and 431 transitions. cyclomatic complexity: 277 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:57:03,650 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 203 states and 431 transitions. cyclomatic complexity: 277. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 423 states and 889 transitions. Complement of second has 6 states. [2025-04-26 16:57:03,651 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:57:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:57:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 16:57:03,652 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:03,652 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,652 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:03,652 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,652 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:57:03,652 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 889 transitions. [2025-04-26 16:57:03,658 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 56 [2025-04-26 16:57:03,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 233 states and 485 transitions. [2025-04-26 16:57:03,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-04-26 16:57:03,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2025-04-26 16:57:03,662 INFO L74 IsDeterministic]: Start isDeterministic. Operand 233 states and 485 transitions. [2025-04-26 16:57:03,662 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:03,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 485 transitions. [2025-04-26 16:57:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 485 transitions. [2025-04-26 16:57:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2025-04-26 16:57:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 2.1013824884792625) internal successors, (in total 456), 216 states have internal predecessors, (456), 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:57:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 456 transitions. [2025-04-26 16:57:03,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 217 states and 456 transitions. [2025-04-26 16:57:03,670 INFO L438 stractBuchiCegarLoop]: Abstraction has 217 states and 456 transitions. [2025-04-26 16:57:03,670 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:03,670 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 456 transitions. [2025-04-26 16:57:03,671 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 56 [2025-04-26 16:57:03,671 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:03,671 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:03,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:57:03,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:03,672 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[54] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[56] L27-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[59] $Ultimate##0-->L34-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:57:03,672 INFO L754 eck$LassoCheckResult]: Loop: "[61] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[63] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:03,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2023647767, now seen corresponding path program 1 times [2025-04-26 16:57:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254651372] [2025-04-26 16:57:03,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2915, now seen corresponding path program 1 times [2025-04-26 16:57:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925647883] [2025-04-26 16:57:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 894682955, now seen corresponding path program 1 times [2025-04-26 16:57:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527961159] [2025-04-26 16:57:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:03,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:03,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:03,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,709 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,710 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,710 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,710 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,710 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:03,710 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,710 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,710 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,710 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:03,710 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,710 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,726 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,726 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:03,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,728 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:57:03,730 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:57:03,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:03,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,749 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:57:03,751 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:57:03,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:03,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,820 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,825 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:57:03,825 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,825 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,825 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,825 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,825 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,825 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:03,825 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,825 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,844 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,844 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,852 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:57:03,854 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:57:03,855 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:57:03,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,867 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,870 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:03,870 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:03,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,872 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:57:03,874 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:57:03,876 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,879 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:03,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:57:03,880 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,880 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,880 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:57:03,886 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:57:03,888 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,929 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:57:03,930 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:57:03,930 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 456 transitions. cyclomatic complexity: 287 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:57:03,982 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 456 transitions. cyclomatic complexity: 287. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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 659 states and 1321 transitions. Complement of second has 7 states. [2025-04-26 16:57:03,982 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:57:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:57:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-04-26 16:57:03,983 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:03,983 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,983 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:57:03,983 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,983 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:57:03,984 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 1321 transitions. [2025-04-26 16:57:03,988 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 56 [2025-04-26 16:57:03,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 382 states and 779 transitions. [2025-04-26 16:57:03,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2025-04-26 16:57:03,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2025-04-26 16:57:03,992 INFO L74 IsDeterministic]: Start isDeterministic. Operand 382 states and 779 transitions. [2025-04-26 16:57:03,992 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:03,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 382 states and 779 transitions. [2025-04-26 16:57:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states and 779 transitions. [2025-04-26 16:57:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 281. [2025-04-26 16:57:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 2.113879003558719) internal successors, (in total 594), 280 states have internal predecessors, (594), 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:57:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 594 transitions. [2025-04-26 16:57:04,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 594 transitions. [2025-04-26 16:57:04,002 INFO L438 stractBuchiCegarLoop]: Abstraction has 281 states and 594 transitions. [2025-04-26 16:57:04,002 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:04,002 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 594 transitions. [2025-04-26 16:57:04,003 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 56 [2025-04-26 16:57:04,003 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:04,003 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:04,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:04,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:04,005 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L12: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] $Ultimate##0-->L34-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[61] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[63] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[60] L34-1-->thread2FINAL: Formula: (<= v_x1_8 v_y_2) InVars {y=v_y_2, x1=v_x1_8} OutVars{y=v_y_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-04-26 16:57:04,005 INFO L754 eck$LassoCheckResult]: Loop: "[55] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:04,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1691582607, now seen corresponding path program 1 times [2025-04-26 16:57:04,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670586924] [2025-04-26 16:57:04,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:04,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:04,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:57:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:04,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670586924] [2025-04-26 16:57:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670586924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:57:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191848564] [2025-04-26 16:57:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:04,084 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:04,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2025-04-26 16:57:04,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626005867] [2025-04-26 16:57:04,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:57:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:57:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,107 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,107 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,107 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,107 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,107 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:04,107 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,107 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,107 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,107 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:04,107 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,107 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,121 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,122 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:04,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,124 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:57:04,125 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:57:04,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:04,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:57:04,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,143 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:57:04,144 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:57:04,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:04,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,215 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:04,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:57:04,219 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,219 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,219 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,219 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,219 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:04,219 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,219 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,220 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,220 INFO L132 ssoRankerPreferences]: Filename of dumped script: m5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:04,220 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,220 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,236 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,236 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:04,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,238 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:57:04,240 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:57:04,241 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:57:04,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:04,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:04,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:04,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:04,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:04,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:04,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:04,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:04,258 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:04,259 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,261 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:57:04,262 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:57:04,263 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:04,266 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:57:04,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,266 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:04,266 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:04,266 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:57:04,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,273 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:04,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:04,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:04,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,326 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:57:04,326 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:57:04,327 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 281 states and 594 transitions. cyclomatic complexity: 373 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:57:04,359 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 281 states and 594 transitions. cyclomatic complexity: 373. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 358 states and 733 transitions. Complement of second has 6 states. [2025-04-26 16:57:04,360 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:57:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:57:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-26 16:57:04,361 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:04,361 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,361 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:57:04,361 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,362 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:57:04,362 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 358 states and 733 transitions. [2025-04-26 16:57:04,364 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 36 [2025-04-26 16:57:04,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 358 states to 248 states and 513 transitions. [2025-04-26 16:57:04,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-04-26 16:57:04,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2025-04-26 16:57:04,367 INFO L74 IsDeterministic]: Start isDeterministic. Operand 248 states and 513 transitions. [2025-04-26 16:57:04,367 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:04,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 248 states and 513 transitions. [2025-04-26 16:57:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 513 transitions. [2025-04-26 16:57:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-04-26 16:57:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 248 states have (on average 2.068548387096774) internal successors, (in total 513), 247 states have internal predecessors, (513), 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:57:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 513 transitions. [2025-04-26 16:57:04,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 248 states and 513 transitions. [2025-04-26 16:57:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:04,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:57:04,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:57:04,387 INFO L87 Difference]: Start difference. First operand 248 states and 513 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 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:57:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:04,393 INFO L93 Difference]: Finished difference Result 32 states and 55 transitions. [2025-04-26 16:57:04,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 55 transitions. [2025-04-26 16:57:04,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2025-04-26 16:57:04,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:04,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:04,394 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,394 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:04,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:57:04,395 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,395 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:04,395 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,395 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,395 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:04,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,410 INFO L201 PluginConnector]: Adding new model m5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:04 BoogieIcfgContainer [2025-04-26 16:57:04,410 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:04,411 INFO L158 Benchmark]: Toolchain (without parser) took 2518.29ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 94.7MB in the beginning and 79.3MB in the end (delta: 15.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,411 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 92.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,411 INFO L158 Benchmark]: Boogie Preprocessor took 22.52ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:57:04,411 INFO L158 Benchmark]: RCFGBuilder took 162.99ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 83.0MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:04,411 INFO L158 Benchmark]: BuchiAutomizer took 2295.28ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.0MB in the beginning and 79.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,413 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.12ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 92.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.52ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 91.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 162.99ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 83.0MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2295.28ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.0MB in the beginning and 79.3MB in the end (delta: 3.7MB). 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.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 205 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, 143 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 92 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 44ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 242, Number of transitions in reduction automaton: 269, Number of states in reduction automaton: 142, 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 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y 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 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:57:04,423 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...