/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/bb4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:06,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:06,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:06,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:06,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:06,462 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:06,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:06,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:06,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:06,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:06,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:06,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:06,483 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:06,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:06,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:06,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:06,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:06,484 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:06,485 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:06,485 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:06,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:06,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:06,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:06,711 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:06,712 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:06,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb4.c.bpl [2025-04-26 18:42:06,714 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb4.c.bpl' [2025-04-26 18:42:06,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:06,730 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:06,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:06,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:06,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:06,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,763 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:06,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:06,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:06,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:06,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:06,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:06,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:06,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:06,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:06,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/1) ... [2025-04-26 18:42:06,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:06,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:06,825 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:06,831 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:06,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:06,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:06,849 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:06,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:06,849 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:06,886 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:06,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:06,957 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:06,958 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:06,967 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:06,967 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:06,968 INFO L201 PluginConnector]: Adding new model bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:06 BoogieIcfgContainer [2025-04-26 18:42:06,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:06,969 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:06,969 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:06,974 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:06,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:06,975 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:06" (1/2) ... [2025-04-26 18:42:06,976 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13d15321 and model type bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:06, skipping insertion in model container [2025-04-26 18:42:06,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:06,976 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:06" (2/2) ... [2025-04-26 18:42:06,978 INFO L376 chiAutomizerObserver]: Analyzing ICFG bb4.c.bpl [2025-04-26 18:42:07,026 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:07,071 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,075 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:07,078 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:07,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 62 flow [2025-04-26 18:42:07,145 INFO L116 PetriNetUnfolderBase]: 4/20 cut-off events. [2025-04-26 18:42:07,147 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:07,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 4/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:42:07,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 62 flow [2025-04-26 18:42:07,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 20 transitions, 52 flow [2025-04-26 18:42:07,155 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 20 transitions, 52 flow [2025-04-26 18:42:07,155 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 20 transitions, 52 flow [2025-04-26 18:42:07,168 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52 states, 51 states have (on average 2.235294117647059) internal successors, (in total 114), 51 states have internal predecessors, (114), 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:07,168 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 52 states, 51 states have (on average 2.235294117647059) internal successors, (in total 114), 51 states have internal predecessors, (114), 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:07,171 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:07,280 WARN L140 AmpleReduction]: Number of pruned transitions: 12 [2025-04-26 18:42:07,281 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:07,281 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 8 [2025-04-26 18:42:07,281 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:32 [2025-04-26 18:42:07,281 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 18:42:07,281 WARN L145 AmpleReduction]: Times succ was already a loop node:28 [2025-04-26 18:42:07,281 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1 [2025-04-26 18:42:07,281 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:07,282 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 52 states, 51 states have (on average 2.0) internal successors, (in total 102), 51 states have internal predecessors, (102), 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:07,291 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:07,292 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:07,292 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:07,292 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:07,292 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:07,292 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:07,292 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:07,292 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:07,294 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 2.0) internal successors, (in total 102), 51 states have internal predecessors, (102), 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:07,309 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 18:42:07,309 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:07,309 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:07,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:07,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:07,315 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:07,316 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 2.0) internal successors, (in total 102), 51 states have internal predecessors, (102), 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:07,317 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 18:42:07,317 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:07,317 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:07,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:07,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:07,324 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:07,325 INFO L754 eck$LassoCheckResult]: Loop: "[55] L22-->L24: 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[]" "[58] L24-->L22: 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:07,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2581, now seen corresponding path program 1 times [2025-04-26 18:42:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:07,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956122859] [2025-04-26 18:42:07,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:07,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:07,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:07,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2724, now seen corresponding path program 1 times [2025-04-26 18:42:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:07,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001902317] [2025-04-26 18:42:07,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:07,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:07,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:07,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2482104, now seen corresponding path program 1 times [2025-04-26 18:42:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:07,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034814709] [2025-04-26 18:42:07,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:07,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:07,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:07,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:07,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:07,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:07,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:07,478 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:07,478 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:07,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:07,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:07,480 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:07,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:07,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:07,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:07,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:07,480 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:07,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:07,574 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:07,574 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:07,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,578 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:07,579 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:07,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:07,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:07,605 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 18:42:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,608 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:07,609 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:07,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:07,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:07,682 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:07,686 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:07,687 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:07,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:07,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:07,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:07,687 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:07,687 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:07,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:07,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:07,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:07,687 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:07,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:07,706 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:07,709 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,711 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:07,712 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:07,718 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:07,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:07,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:07,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:07,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:07,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:07,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:07,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:07,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:07,738 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:07,738 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:07,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:07,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:07,753 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:07,754 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:07,758 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:07,763 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:07,764 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:07,764 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:07,765 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:07,776 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:07,783 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:07,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:07,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:07,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:07,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:07,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:07,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:07,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:07,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:07,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:07,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:07,840 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:07,853 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:07,855 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 52 states, 51 states have (on average 2.0) internal successors, (in total 102), 51 states have internal predecessors, (102), 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 18:42:07,973 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 52 states, 51 states have (on average 2.0) internal successors, (in total 102), 51 states have internal predecessors, (102), 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 178 states and 365 transitions. Complement of second has 7 states. [2025-04-26 18:42:07,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:07,977 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 18:42:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-04-26 18:42:07,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:07,985 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:07,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:07,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:07,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:07,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:07,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 365 transitions. [2025-04-26 18:42:07,992 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2025-04-26 18:42:07,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 86 states and 195 transitions. [2025-04-26 18:42:07,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-04-26 18:42:07,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-04-26 18:42:07,998 INFO L74 IsDeterministic]: Start isDeterministic. Operand 86 states and 195 transitions. [2025-04-26 18:42:07,998 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:07,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 195 transitions. [2025-04-26 18:42:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 195 transitions. [2025-04-26 18:42:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-04-26 18:42:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.2816901408450705) internal successors, (in total 162), 70 states have internal predecessors, (162), 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:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 162 transitions. [2025-04-26 18:42:08,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 162 transitions. [2025-04-26 18:42:08,021 INFO L438 stractBuchiCegarLoop]: Abstraction has 71 states and 162 transitions. [2025-04-26 18:42:08,022 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:08,022 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 162 transitions. [2025-04-26 18:42:08,023 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2025-04-26 18:42:08,023 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:08,023 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:08,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:08,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:08,023 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L22-->L26-1: 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[]" [2025-04-26 18:42:08,023 INFO L754 eck$LassoCheckResult]: Loop: "[57] L26-1-->L28: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[60] L28-->L26-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:08,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 80065, now seen corresponding path program 1 times [2025-04-26 18:42:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452629913] [2025-04-26 18:42:08,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2788, now seen corresponding path program 1 times [2025-04-26 18:42:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915425551] [2025-04-26 18:42:08,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash 76944292, now seen corresponding path program 1 times [2025-04-26 18:42:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377565925] [2025-04-26 18:42:08,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:08,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:08,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:08,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,071 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,071 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,071 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,071 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,071 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:08,071 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,071 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,071 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,071 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:08,071 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,071 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,092 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,092 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,096 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:08,097 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:08,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:08,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,117 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:08,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,120 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:08,121 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:08,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:08,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,188 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:08,192 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 18:42:08,193 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,193 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,193 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,193 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,193 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:08,193 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,193 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,193 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,193 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:08,193 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,193 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,218 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,218 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,220 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:08,221 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:08,222 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:08,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:08,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:08,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:08,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:08,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:08,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:08,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:08,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:08,237 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:08,238 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,239 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:08,242 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:08,242 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:08,245 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:08,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:08,246 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:08,246 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:08,246 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:08,252 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:08,253 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:08,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,288 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,301 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:08,301 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:08,301 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 162 transitions. cyclomatic complexity: 112 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:08,348 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 162 transitions. cyclomatic complexity: 112. 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 176 states and 362 transitions. Complement of second has 7 states. [2025-04-26 18:42:08,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:08,349 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:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-04-26 18:42:08,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:08,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:08,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:08,350 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 362 transitions. [2025-04-26 18:42:08,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:08,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 16 states and 35 transitions. [2025-04-26 18:42:08,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 18:42:08,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-04-26 18:42:08,353 INFO L74 IsDeterministic]: Start isDeterministic. Operand 16 states and 35 transitions. [2025-04-26 18:42:08,353 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:08,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-04-26 18:42:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 35 transitions. [2025-04-26 18:42:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-26 18:42:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (in total 35), 15 states have internal predecessors, (35), 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:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2025-04-26 18:42:08,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-04-26 18:42:08,354 INFO L438 stractBuchiCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-04-26 18:42:08,354 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:08,355 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 35 transitions. [2025-04-26 18:42:08,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:08,355 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:08,355 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:08,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:08,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:08,356 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L13-1-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:08,356 INFO L754 eck$LassoCheckResult]: Loop: "[62] L35-->L37: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[65] L37-->L35: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:08,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 80084, now seen corresponding path program 1 times [2025-04-26 18:42:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192151089] [2025-04-26 18:42:08,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2948, now seen corresponding path program 1 times [2025-04-26 18:42:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669797455] [2025-04-26 18:42:08,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 76962711, now seen corresponding path program 1 times [2025-04-26 18:42:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:08,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115681113] [2025-04-26 18:42:08,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:08,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:08,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:08,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:08,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:08,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:08,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:08,392 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:08,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:08,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,393 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,411 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,412 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,413 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 18:42:08,415 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 18:42:08,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:08,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:08,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,433 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 18:42:08,434 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 18:42:08,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:08,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:08,500 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:08,504 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 18:42:08,504 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:08,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:08,505 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:08,505 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:08,505 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:08,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:08,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:08,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:08,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:08,505 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:08,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:08,518 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:08,518 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,520 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 18:42:08,522 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 18:42:08,526 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:08,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:08,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:08,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:08,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:08,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:08,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:08,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:08,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:08,540 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:08,540 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:08,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:08,542 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 18:42:08,542 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 18:42:08,547 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:08,550 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 18:42:08,550 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:08,550 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:08,551 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:08,556 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 18:42:08,557 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:08,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:08,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:08,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:08,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:08,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:08,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:08,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:08,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:08,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 18:42:08,600 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:08,600 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 35 transitions. cyclomatic complexity: 23 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:08,620 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 35 transitions. cyclomatic complexity: 23. 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 34 states and 69 transitions. Complement of second has 6 states. [2025-04-26 18:42:08,620 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:08,621 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:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-04-26 18:42:08,621 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:08,621 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,621 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:08,621 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,621 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:08,621 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:08,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 69 transitions. [2025-04-26 18:42:08,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:08,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2025-04-26 18:42:08,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:08,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:08,622 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:08,622 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:08,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:08,622 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:08,622 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:08,622 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:08,622 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:08,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:08,622 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:08,632 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:08,633 INFO L201 PluginConnector]: Adding new model bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:08 BoogieIcfgContainer [2025-04-26 18:42:08,633 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:08,634 INFO L158 Benchmark]: Toolchain (without parser) took 1903.70ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.1MB in the beginning and 56.0MB in the end (delta: 28.1MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:08,634 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.67ms. Allocated memory is still 155.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:08,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.18ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:08,634 INFO L158 Benchmark]: Boogie Preprocessor took 25.82ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:08,634 INFO L158 Benchmark]: RCFGBuilder took 175.95ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 72.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:08,635 INFO L158 Benchmark]: BuchiAutomizer took 1664.52ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.3MB in the beginning and 56.0MB in the end (delta: 16.2MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2025-04-26 18:42:08,636 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.67ms. Allocated memory is still 155.2MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.18ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.82ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 175.95ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 72.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1664.52ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.3MB in the beginning and 56.0MB in the end (delta: 16.2MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 29 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 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: 54ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 214, Number of transitions in reduction automaton: 102, Number of states in reduction automaton: 52, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + 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:08,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...