/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/bb3_b.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:33,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:33,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:33,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:33,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:33,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:33,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:33,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:33,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:33,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:33,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:33,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:33,720 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:33,720 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:33,720 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:33,720 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:33,720 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:33,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:33,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:33,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:33,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:33,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:33,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:33,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:33,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:33,722 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:33,722 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:33,722 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:33,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:33,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:33,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:33,954 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:33,954 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:33,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb3_b.c.bpl [2025-04-26 16:56:33,957 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb3_b.c.bpl' [2025-04-26 16:56:33,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:33,973 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:33,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:33,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:33,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:33,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,009 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:34,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:34,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:34,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:34,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:34,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:34,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:34,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:34,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:34,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/1) ... [2025-04-26 16:56:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:34,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:34,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:34,090 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:34,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:34,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:34,092 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:34,127 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:34,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:34,216 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:34,216 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:34,228 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:34,229 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:34,229 INFO L201 PluginConnector]: Adding new model bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:34 BoogieIcfgContainer [2025-04-26 16:56:34,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:34,230 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:34,230 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:34,234 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:34,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:34,235 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:33" (1/2) ... [2025-04-26 16:56:34,237 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e40d14 and model type bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:34, skipping insertion in model container [2025-04-26 16:56:34,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:34,237 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:34" (2/2) ... [2025-04-26 16:56:34,238 INFO L376 chiAutomizerObserver]: Analyzing ICFG bb3_b.c.bpl [2025-04-26 16:56:34,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:34,332 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:34,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:34,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-04-26 16:56:34,412 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-26 16:56:34,415 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:34,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:56:34,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-04-26 16:56:34,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 60 flow [2025-04-26 16:56:34,424 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 24 transitions, 60 flow [2025-04-26 16:56:34,429 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:34,562 WARN L140 AmpleReduction]: Number of pruned transitions: 40 [2025-04-26 16:56:34,563 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:34,563 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 11 [2025-04-26 16:56:34,563 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:33 [2025-04-26 16:56:34,563 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:34 [2025-04-26 16:56:34,563 WARN L145 AmpleReduction]: Times succ was already a loop node:29 [2025-04-26 16:56:34,563 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:56:34,563 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:34,567 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 79 states, 78 states have (on average 1.6666666666666667) internal successors, (in total 130), 78 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:34,573 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:34,574 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:34,574 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:34,574 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:34,574 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:34,574 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:34,574 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:34,574 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:34,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.6666666666666667) internal successors, (in total 130), 78 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:34,586 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 47 [2025-04-26 16:56:34,586 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:34,586 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:34,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:34,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:34,589 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:34,590 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.6666666666666667) internal successors, (in total 130), 78 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:34,595 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 47 [2025-04-26 16:56:34,595 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:34,595 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:34,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:34,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:34,600 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:34,601 INFO L754 eck$LassoCheckResult]: Loop: "[63] 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[]" "[65] 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 16:56:34,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2779, now seen corresponding path program 1 times [2025-04-26 16:56:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447870216] [2025-04-26 16:56:34,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:34,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 16:56:34,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356856135] [2025-04-26 16:56:34,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:34,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2672637, now seen corresponding path program 1 times [2025-04-26 16:56:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867407149] [2025-04-26 16:56:34,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:34,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:34,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:34,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:34,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,764 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:34,766 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:34,766 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:34,766 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:34,767 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:34,767 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:34,767 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:34,767 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:34,767 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:34,767 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:34,768 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:34,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:34,845 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:34,846 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:34,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:34,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:34,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:34,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:34,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:34,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:34,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:34,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:34,980 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:34,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:34,985 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:34,985 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:34,985 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:34,985 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:34,985 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:34,985 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:34,985 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:34,985 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:34,985 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:34,985 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:34,985 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:34,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,019 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,022 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:35,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:35,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:35,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:35,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:35,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:35,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:35,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:35,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:35,051 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:35,057 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:35,058 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:35,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:35,063 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:35,066 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:35,067 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 16:56:35,067 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:35,068 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:35,068 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:56:35,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:35,077 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:35,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:35,208 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:35,210 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 79 states, 78 states have (on average 1.6666666666666667) internal successors, (in total 130), 78 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,312 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 79 states, 78 states have (on average 1.6666666666666667) internal successors, (in total 130), 78 states have internal predecessors, (130), 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 170 states and 282 transitions. Complement of second has 7 states. [2025-04-26 16:56:35,314 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 16:56:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-26 16:56:35,322 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:56:35,323 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,323 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:35,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:56:35,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 282 transitions. [2025-04-26 16:56:35,331 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 38 [2025-04-26 16:56:35,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 80 states and 134 transitions. [2025-04-26 16:56:35,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-04-26 16:56:35,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-04-26 16:56:35,338 INFO L74 IsDeterministic]: Start isDeterministic. Operand 80 states and 134 transitions. [2025-04-26 16:56:35,339 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:35,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 134 transitions. [2025-04-26 16:56:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 134 transitions. [2025-04-26 16:56:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-04-26 16:56:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.726027397260274) internal successors, (in total 126), 72 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 126 transitions. [2025-04-26 16:56:35,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 126 transitions. [2025-04-26 16:56:35,363 INFO L438 stractBuchiCegarLoop]: Abstraction has 73 states and 126 transitions. [2025-04-26 16:56:35,363 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:35,363 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 126 transitions. [2025-04-26 16:56:35,365 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 38 [2025-04-26 16:56:35,365 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:35,365 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:35,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:35,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:35,366 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[63] 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[]" "[85] L13-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:35,366 INFO L754 eck$LassoCheckResult]: Loop: "[72] L37-->L39: 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[]" "[74] L39-->L37: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:35,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2672657, now seen corresponding path program 1 times [2025-04-26 16:56:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455840422] [2025-04-26 16:56:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:35,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:56:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780793472] [2025-04-26 16:56:35,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1726541613, now seen corresponding path program 1 times [2025-04-26 16:56:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148722887] [2025-04-26 16:56:35,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:35,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:35,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:35,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:35,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,420 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,420 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,420 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,420 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,420 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:35,420 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,420 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,420 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,420 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:35,420 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,420 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,444 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,444 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:35,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:35,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:35,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:56:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:35,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:35,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,541 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:35,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:35,545 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,545 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,545 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,545 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,546 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:35,546 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,546 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:35,546 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,546 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,569 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,569 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:35,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,571 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:35,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:35,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:35,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:35,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:35,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:35,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:35,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:35,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:35,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:35,591 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:35,591 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,593 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:35,597 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:35,600 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 16:56:35,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:35,601 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:35,601 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:35,601 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:56:35,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:35,608 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:35,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:35,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:35,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,645 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:35,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:35,663 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 126 transitions. cyclomatic complexity: 74 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,731 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 126 transitions. cyclomatic complexity: 74. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 223 states and 406 transitions. Complement of second has 7 states. [2025-04-26 16:56:35,733 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 16:56:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-26 16:56:35,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:35,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:35,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:35,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 406 transitions. [2025-04-26 16:56:35,737 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:56:35,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 134 states and 240 transitions. [2025-04-26 16:56:35,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 16:56:35,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-04-26 16:56:35,739 INFO L74 IsDeterministic]: Start isDeterministic. Operand 134 states and 240 transitions. [2025-04-26 16:56:35,739 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:35,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 240 transitions. [2025-04-26 16:56:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 240 transitions. [2025-04-26 16:56:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 118. [2025-04-26 16:56:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.8644067796610169) internal successors, (in total 220), 117 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 220 transitions. [2025-04-26 16:56:35,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 220 transitions. [2025-04-26 16:56:35,744 INFO L438 stractBuchiCegarLoop]: Abstraction has 118 states and 220 transitions. [2025-04-26 16:56:35,744 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:35,744 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 220 transitions. [2025-04-26 16:56:35,745 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:56:35,745 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:35,745 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:35,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:35,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:35,746 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] L22-->L26: 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[]" "[64] L26-->L27: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[66] L27-->L28-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:35,746 INFO L754 eck$LassoCheckResult]: Loop: "[68] L28-1-->L30: 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[]" "[70] L30-->L28-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 16:56:35,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 82850821, now seen corresponding path program 1 times [2025-04-26 16:56:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306024025] [2025-04-26 16:56:35,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:35,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:35,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:35,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306024025] [2025-04-26 16:56:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306024025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:35,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238267702] [2025-04-26 16:56:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:35,792 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:35,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:56:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572667823] [2025-04-26 16:56:35,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:35,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,815 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,816 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:35,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:35,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,816 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,836 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,836 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:35,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,839 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:35,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:35,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:56:35,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:35,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:35,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,935 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:35,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:35,939 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:35,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:35,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,940 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,958 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,958 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:35,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:35,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:35,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:35,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:35,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:35,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:35,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:35,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:35,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:35,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:35,977 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:35,977 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:35,981 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:35,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:56:35,984 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:35,984 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:35,984 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:56:35,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:35,991 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:36,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:36,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:36,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:36,035 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:36,035 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 220 transitions. cyclomatic complexity: 123 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,082 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 220 transitions. cyclomatic complexity: 123. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 280 states and 578 transitions. Complement of second has 7 states. [2025-04-26 16:56:36,082 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 16:56:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-04-26 16:56:36,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:36,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:36,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:56:36,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 578 transitions. [2025-04-26 16:56:36,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:56:36,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 178 states and 340 transitions. [2025-04-26 16:56:36,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-04-26 16:56:36,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2025-04-26 16:56:36,087 INFO L74 IsDeterministic]: Start isDeterministic. Operand 178 states and 340 transitions. [2025-04-26 16:56:36,088 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:36,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 340 transitions. [2025-04-26 16:56:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 340 transitions. [2025-04-26 16:56:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 120. [2025-04-26 16:56:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.85) internal successors, (in total 222), 119 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 222 transitions. [2025-04-26 16:56:36,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 222 transitions. [2025-04-26 16:56:36,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:36,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:36,094 INFO L87 Difference]: Start difference. First operand 120 states and 222 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:36,123 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2025-04-26 16:56:36,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 100 transitions. [2025-04-26 16:56:36,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:36,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 84 transitions. [2025-04-26 16:56:36,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-04-26 16:56:36,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-04-26 16:56:36,126 INFO L74 IsDeterministic]: Start isDeterministic. Operand 51 states and 84 transitions. [2025-04-26 16:56:36,126 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:36,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 84 transitions. [2025-04-26 16:56:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 84 transitions. [2025-04-26 16:56:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-26 16:56:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6470588235294117) internal successors, (in total 84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2025-04-26 16:56:36,128 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 84 transitions. [2025-04-26 16:56:36,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:36,130 INFO L438 stractBuchiCegarLoop]: Abstraction has 51 states and 84 transitions. [2025-04-26 16:56:36,130 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:36,130 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 84 transitions. [2025-04-26 16:56:36,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:36,130 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:36,130 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:36,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:36,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:36,131 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] L22-->L26: 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[]" "[64] L26-->L27: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[85] L13-1-->L37: 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]" "[71] L37-->L41: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[73] L41-->L42: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[66] L27-->L28-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[67] L28-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[75] L42-->L43-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:56:36,131 INFO L754 eck$LassoCheckResult]: Loop: "[77] L43-1-->L45: Formula: (< v_x1_5 v_z_7) InVars {x1=v_x1_5, z=v_z_7} OutVars{x1=v_x1_5, z=v_z_7} AuxVars[] AssignedVars[]" "[79] L45-->L43-1: Formula: (= v_x4_1 (+ v_x4_2 1)) InVars {x4=v_x4_2} OutVars{x4=v_x4_1} AuxVars[] AssignedVars[x4]" [2025-04-26 16:56:36,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2047823600, now seen corresponding path program 1 times [2025-04-26 16:56:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318807389] [2025-04-26 16:56:36,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:36,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:36,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:36,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:36,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2025-04-26 16:56:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560672626] [2025-04-26 16:56:36,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:36,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:36,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash 863460498, now seen corresponding path program 1 times [2025-04-26 16:56:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342763787] [2025-04-26 16:56:36,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:36,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:36,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342763787] [2025-04-26 16:56:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342763787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:36,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:36,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:36,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119159492] [2025-04-26 16:56:36,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:36,190 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,190 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,190 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,190 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,190 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:36,190 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,190 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,190 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,190 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:36,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,190 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,206 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,206 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:36,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:36,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:36,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:36,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,296 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:36,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:36,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,342 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:36,342 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x4=0} Honda state: {x4=0} Generalized eigenvectors: [{x4=2}, {x4=-6}, {x4=5}] Lambdas: [4, 1, 1] Nus: [1, 0] [2025-04-26 16:56:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,351 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:36,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:36,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,371 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:36,371 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0, z=1} Honda state: {x1=0, z=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:36,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:36,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:36,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:36,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:36,378 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:36,392 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2025-04-26 16:56:36,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. [2025-04-26 16:56:36,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2025-04-26 16:56:36,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:36,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:36,392 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,392 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:36,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:36,394 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,394 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:36,394 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,394 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:36,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:36,408 INFO L201 PluginConnector]: Adding new model bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:36 BoogieIcfgContainer [2025-04-26 16:56:36,408 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:36,408 INFO L158 Benchmark]: Toolchain (without parser) took 2435.03ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 90.9MB in the beginning and 37.8MB in the end (delta: 53.1MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,408 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.69ms. Allocated memory is still 163.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.00ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 89.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,409 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,409 INFO L158 Benchmark]: RCFGBuilder took 189.39ms. Allocated memory is still 163.6MB. Free memory was 88.0MB in the beginning and 78.1MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,409 INFO L158 Benchmark]: BuchiAutomizer took 2177.69ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 78.0MB in the beginning and 37.8MB in the end (delta: 40.2MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,410 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.69ms. Allocated memory is still 163.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.00ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 89.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 189.39ms. Allocated memory is still 163.6MB. Free memory was 88.0MB in the beginning and 78.1MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2177.69ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 78.0MB in the beginning and 37.8MB in the end (delta: 40.2MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 81 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 83 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf95 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 235, Number of transitions in reduction automaton: 130, Number of states in reduction automaton: 79, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 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 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:36,425 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...