/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/m1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:17,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:17,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:17,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:17,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:17,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:17,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:17,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:17,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:17,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:17,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:17,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:17,937 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:17,937 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:17,937 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:17,937 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:17,937 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:17,938 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:17,939 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:17,939 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:17,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:17,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:17,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:17,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:17,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:17,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:17,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:17,941 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:17,941 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:17,941 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:18,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:18,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:18,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:18,170 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:18,171 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:18,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/m1.c.bpl [2025-04-26 18:42:18,174 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/m1.c.bpl' [2025-04-26 18:42:18,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:18,187 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:18,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:18,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:18,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:18,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,220 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:18,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:18,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:18,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:18,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:18,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:18,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:18,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:18,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:18,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/1) ... [2025-04-26 18:42:18,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,268 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 18:42:18,274 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 18:42:18,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:18,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:18,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:18,293 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 18:42:18,330 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:18,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:18,384 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:18,384 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:18,390 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:18,390 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:18,391 INFO L201 PluginConnector]: Adding new model m1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:18 BoogieIcfgContainer [2025-04-26 18:42:18,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:18,391 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:18,391 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:18,399 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:18,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:18,400 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:18" (1/2) ... [2025-04-26 18:42:18,401 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65088f0e and model type m1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:18, skipping insertion in model container [2025-04-26 18:42:18,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:18,401 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:18" (2/2) ... [2025-04-26 18:42:18,406 INFO L376 chiAutomizerObserver]: Analyzing ICFG m1.c.bpl [2025-04-26 18:42:18,457 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:18,501 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:18,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:18,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,504 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 18:42:18,506 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 18:42:18,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 15 transitions, 44 flow [2025-04-26 18:42:18,563 INFO L116 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-04-26 18:42:18,564 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:18,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 11 events. 1/11 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2025-04-26 18:42:18,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 15 transitions, 44 flow [2025-04-26 18:42:18,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 11 transitions, 34 flow [2025-04-26 18:42:18,571 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 17 places, 11 transitions, 34 flow [2025-04-26 18:42:18,572 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 11 transitions, 34 flow [2025-04-26 18:42:18,582 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (in total 36), 21 states have internal predecessors, (36), 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 18:42:18,582 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (in total 36), 21 states have internal predecessors, (36), 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 18:42:18,584 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:18,626 WARN L140 AmpleReduction]: Number of pruned transitions: 6 [2025-04-26 18:42:18,626 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:18,626 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:42:18,626 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 18:42:18,627 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6 [2025-04-26 18:42:18,627 WARN L145 AmpleReduction]: Times succ was already a loop node:4 [2025-04-26 18:42:18,627 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:42:18,628 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:18,628 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 21 states, 20 states have (on average 1.45) internal successors, (in total 29), 20 states have internal predecessors, (29), 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 18:42:18,633 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:18,633 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:18,633 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:18,633 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:18,633 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:18,633 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:18,633 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:18,633 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:18,634 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.45) internal successors, (in total 29), 20 states have internal predecessors, (29), 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 18:42:18,642 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:18,642 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:18,642 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:18,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:18,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:18,645 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:18,646 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.45) internal successors, (in total 29), 20 states have internal predecessors, (29), 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 18:42:18,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:18,646 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:18,647 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:18,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:18,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:18,650 INFO L752 eck$LassoCheckResult]: Stem: "[33] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:18,650 INFO L754 eck$LassoCheckResult]: Loop: "[26] L21-->L23: 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[]" "[28] L23-->L21: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:18,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2025-04-26 18:42:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:18,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934258256] [2025-04-26 18:42:18,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:18,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:18,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:18,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times [2025-04-26 18:42:18,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:18,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177414012] [2025-04-26 18:42:18,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:18,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:18,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:18,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:18,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:18,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:18,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 62338, now seen corresponding path program 1 times [2025-04-26 18:42:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:18,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911339502] [2025-04-26 18:42:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:18,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:18,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:18,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:18,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:18,798 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:18,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:18,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:18,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:18,799 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:18,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:18,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:18,800 INFO L132 ssoRankerPreferences]: Filename of dumped script: m1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:18,800 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:18,800 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:18,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,885 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:18,886 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:18,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,890 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 18:42:18,892 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 18:42:18,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:18,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:18,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:18,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,919 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 18:42:18,920 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 18:42:18,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:18,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:19,000 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:19,004 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 18:42:19,004 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:19,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:19,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:19,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:19,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:19,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:19,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:19,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: m1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:19,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:19,005 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:19,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:19,033 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:19,036 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:19,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,060 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 18:42:19,062 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 18:42:19,062 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 18:42:19,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:19,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:19,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:19,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:19,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:19,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:19,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:19,086 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:19,092 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:19,093 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:19,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,096 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 18:42:19,097 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 18:42:19,097 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:19,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:19,101 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:19,102 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:19,102 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:19,108 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 18:42:19,111 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:19,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:19,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:19,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:19,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:19,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:19,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:19,166 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:19,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:19,211 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 18:42:19,227 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 18:42:19,229 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.45) internal successors, (in total 29), 20 states have internal predecessors, (29), 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.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,294 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.45) internal successors, (in total 29), 20 states have internal predecessors, (29), 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.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 33 states and 52 transitions. Complement of second has 7 states. [2025-04-26 18:42:19,296 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 18:42:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-04-26 18:42:19,306 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:19,306 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:19,306 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:19,307 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:19,307 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:19,307 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:19,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 52 transitions. [2025-04-26 18:42:19,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:19,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 16 states and 27 transitions. [2025-04-26 18:42:19,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-04-26 18:42:19,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-04-26 18:42:19,315 INFO L74 IsDeterministic]: Start isDeterministic. Operand 16 states and 27 transitions. [2025-04-26 18:42:19,316 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:19,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 27 transitions. [2025-04-26 18:42:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 27 transitions. [2025-04-26 18:42:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-04-26 18:42:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (in total 25), 13 states have internal predecessors, (25), 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 18:42:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2025-04-26 18:42:19,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 25 transitions. [2025-04-26 18:42:19,333 INFO L438 stractBuchiCegarLoop]: Abstraction has 14 states and 25 transitions. [2025-04-26 18:42:19,333 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:19,333 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 25 transitions. [2025-04-26 18:42:19,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:19,333 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:19,334 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:19,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:19,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:19,334 INFO L752 eck$LassoCheckResult]: Stem: "[33] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[36] L12-->$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]" "[29] $Ultimate##0-->thread2FINAL: Formula: (= v_x1_5 0) InVars {} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:19,334 INFO L754 eck$LassoCheckResult]: Loop: "[26] L21-->L23: 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[]" "[28] L23-->L21: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:19,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash 62649, now seen corresponding path program 1 times [2025-04-26 18:42:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:19,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105351822] [2025-04-26 18:42:19,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:19,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:19,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:19,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:19,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:19,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:19,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:19,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times [2025-04-26 18:42:19,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:19,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203462143] [2025-04-26 18:42:19,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:19,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:19,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:19,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:19,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:19,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 60206523, now seen corresponding path program 1 times [2025-04-26 18:42:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:19,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318534512] [2025-04-26 18:42:19,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:19,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:19,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:19,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:19,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:19,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:19,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:19,385 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:19,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:19,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:19,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:19,385 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:19,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:19,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:19,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: m1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:19,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:19,385 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:19,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:19,405 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:19,405 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,408 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 18:42:19,409 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 18:42:19,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:19,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:19,426 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 18:42:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,428 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 18:42:19,429 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 18:42:19,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:19,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:19,496 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:19,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:19,500 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:19,500 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:19,500 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:19,500 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:19,500 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:19,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:19,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:19,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: m1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:19,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:19,501 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:19,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:19,519 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:19,519 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:19,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,522 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 18:42:19,523 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 18:42:19,535 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 18:42:19,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:19,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:19,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:19,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:19,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:19,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:19,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:19,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:19,554 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:19,554 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:19,558 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 18:42:19,560 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 18:42:19,562 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:19,566 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 18:42:19,567 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:19,567 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:19,567 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:19,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:19,576 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:19,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:19,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:19,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:19,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:19,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:19,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:19,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:19,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:19,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:19,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:19,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:19,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:19,634 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 18:42:19,635 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 18:42:19,635 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 25 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,659 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 25 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 26 states and 41 transitions. Complement of second has 6 states. [2025-04-26 18:42:19,661 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 18:42:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-04-26 18:42:19,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:19,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:19,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:19,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:19,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:19,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:19,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 41 transitions. [2025-04-26 18:42:19,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:19,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-04-26 18:42:19,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:19,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:19,664 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:19,664 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:19,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:19,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:19,664 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:19,664 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:19,664 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:19,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:19,664 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:19,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:19,678 INFO L201 PluginConnector]: Adding new model m1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:19 BoogieIcfgContainer [2025-04-26 18:42:19,678 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:19,679 INFO L158 Benchmark]: Toolchain (without parser) took 1491.14ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 84.5MB in the beginning and 95.1MB in the end (delta: -10.6MB). Peak memory consumption was 424.2kB. Max. memory is 8.0GB. [2025-04-26 18:42:19,679 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:19,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.77ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:19,679 INFO L158 Benchmark]: Boogie Preprocessor took 23.43ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.7MB in the end (delta: 930.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:19,680 INFO L158 Benchmark]: RCFGBuilder took 144.67ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 73.5MB in the end (delta: 8.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:19,680 INFO L158 Benchmark]: BuchiAutomizer took 1286.53ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.3MB in the beginning and 95.1MB in the end (delta: -21.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:19,681 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.71ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.77ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.43ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.7MB in the end (delta: 930.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 144.67ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 73.5MB in the end (delta: 8.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 1286.53ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.3MB in the beginning and 95.1MB in the end (delta: -21.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 8 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 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: 65ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 131, Number of transitions in reduction automaton: 29, Number of states in reduction automaton: 21, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:19,696 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...