/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/c-barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:33,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:33,989 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,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:33,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:33,993 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,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:34,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:34,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:34,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:34,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:34,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:34,013 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:34,014 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:34,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:34,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:34,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:34,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:34,015 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:34,015 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:34,017 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:34,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:34,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:34,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:34,234 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:34,235 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:34,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/c-barrier-2t.c.bpl [2025-04-26 16:56:34,236 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/c-barrier-2t.c.bpl' [2025-04-26 16:56:34,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:34,251 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:34,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:34,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:34,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:34,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,287 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:34,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:34,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:34,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:34,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:34,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:34,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:34,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:34,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:34,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/1) ... [2025-04-26 16:56:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:34,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,329 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,331 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,352 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:34,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:34,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:34,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:34,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:34,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:34,354 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,387 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:34,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:34,457 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:34,458 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:34,466 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:34,467 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:34,469 INFO L201 PluginConnector]: Adding new model c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:34 BoogieIcfgContainer [2025-04-26 16:56:34,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:34,471 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:34,471 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:34,475 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:34,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:34,476 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:34" (1/2) ... [2025-04-26 16:56:34,478 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c019e67 and model type c-barrier-2t.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,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:34,478 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:34" (2/2) ... [2025-04-26 16:56:34,479 INFO L376 chiAutomizerObserver]: Analyzing ICFG c-barrier-2t.c.bpl [2025-04-26 16:56:34,524 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:34,559 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:34,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:34,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:34,562 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,564 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,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 78 flow [2025-04-26 16:56:34,622 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:56:34,624 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:34,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 16:56:34,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 78 flow [2025-04-26 16:56:34,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 68 flow [2025-04-26 16:56:34,629 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 28 transitions, 68 flow [2025-04-26 16:56:34,634 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:34,804 WARN L140 AmpleReduction]: Number of pruned transitions: 53 [2025-04-26 16:56:34,804 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:34,804 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 11 [2025-04-26 16:56:34,804 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:64 [2025-04-26 16:56:34,804 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:47 [2025-04-26 16:56:34,804 WARN L145 AmpleReduction]: Times succ was already a loop node:27 [2025-04-26 16:56:34,804 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:13 [2025-04-26 16:56:34,805 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:34,806 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 123 states, 122 states have (on average 1.7295081967213115) internal successors, (in total 211), 122 states have internal predecessors, (211), 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,811 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:34,811 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:34,811 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:34,811 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:34,811 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:34,812 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:34,812 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:34,812 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:34,813 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 123 states, 122 states have (on average 1.7295081967213115) internal successors, (in total 211), 122 states have internal predecessors, (211), 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,825 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 84 [2025-04-26 16:56:34,826 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:34,826 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:34,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:34,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:34,829 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:34,830 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 123 states, 122 states have (on average 1.7295081967213115) internal successors, (in total 211), 122 states have internal predecessors, (211), 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,834 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 84 [2025-04-26 16:56:34,834 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:34,834 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:34,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:34,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:34,838 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[94] 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,838 INFO L754 eck$LassoCheckResult]: Loop: "[71] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[73] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[75] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:56:34,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 3101, now seen corresponding path program 1 times [2025-04-26 16:56:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080300723] [2025-04-26 16:56:34,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,891 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,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:34,895 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,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash 100360, now seen corresponding path program 1 times [2025-04-26 16:56:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749013218] [2025-04-26 16:56:34,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:34,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:34,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:34,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:34,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:34,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 92452460, now seen corresponding path program 1 times [2025-04-26 16:56:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:34,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681959861] [2025-04-26 16:56:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:34,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:34,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:34,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:34,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:34,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:34,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:34,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:34,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,022 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,023 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:35,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:35,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,024 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,106 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,106 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:35,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:35,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:35,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,133 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:35,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:35,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:35,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:35,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,225 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:35,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:35,230 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,231 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:35,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:35,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,231 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,265 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,268 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:35,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,271 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,272 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,277 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,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:35,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:35,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:35,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:35,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:35,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:35,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:35,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:35,299 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:35,300 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:35,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,323 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,325 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,325 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:35,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:35,328 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:35,329 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:35,329 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z, x1) = -1*x4 + 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:56:35,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:35,336 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:35,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:35,363 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,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,375 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,422 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,438 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:35,440 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 123 states, 122 states have (on average 1.7295081967213115) internal successors, (in total 211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,559 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 123 states, 122 states have (on average 1.7295081967213115) internal successors, (in total 211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 350 states and 622 transitions. Complement of second has 7 states. [2025-04-26 16:56:35,559 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,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-26 16:56:35,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:56:35,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:35,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:56:35,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:35,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 622 transitions. [2025-04-26 16:56:35,580 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 57 [2025-04-26 16:56:35,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 216 states and 404 transitions. [2025-04-26 16:56:35,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2025-04-26 16:56:35,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2025-04-26 16:56:35,586 INFO L74 IsDeterministic]: Start isDeterministic. Operand 216 states and 404 transitions. [2025-04-26 16:56:35,587 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:35,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 216 states and 404 transitions. [2025-04-26 16:56:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 404 transitions. [2025-04-26 16:56:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 196. [2025-04-26 16:56:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.8775510204081634) internal successors, (in total 368), 195 states have internal predecessors, (368), 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,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 368 transitions. [2025-04-26 16:56:35,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 368 transitions. [2025-04-26 16:56:35,610 INFO L438 stractBuchiCegarLoop]: Abstraction has 196 states and 368 transitions. [2025-04-26 16:56:35,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:35,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 368 transitions. [2025-04-26 16:56:35,612 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 57 [2025-04-26 16:56:35,612 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:35,612 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:35,612 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:35,612 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:35,612 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[97] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:35,613 INFO L754 eck$LassoCheckResult]: Loop: "[82] L39-->L41: Formula: (< (+ v_x5_5 v_x3_5) v_z_6) InVars {x5=v_x5_5, x3=v_x3_5, z=v_z_6} OutVars{x5=v_x5_5, x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[84] L41-->L42: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[86] L42-->L39: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-04-26 16:56:35,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash 96228, now seen corresponding path program 1 times [2025-04-26 16:56:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604049001] [2025-04-26 16:56:35,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-04-26 16:56:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591346842] [2025-04-26 16:56:35,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1428157456, now seen corresponding path program 1 times [2025-04-26 16:56:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:35,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021416777] [2025-04-26 16:56:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:35,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:35,634 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,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:35,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:35,636 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,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:35,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:35,655 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,655 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,655 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,655 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,655 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:35,655 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,655 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,655 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:35,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,656 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,681 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,681 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:35,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,684 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,687 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,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:35,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,707 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,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,708 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,709 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,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:35,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:35,793 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:35,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:56:35,797 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:35,797 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:35,797 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:35,797 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:35,797 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:35,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:35,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:35,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:35,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:35,798 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:35,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:35,821 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:35,821 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,825 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,825 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,827 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,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:35,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:35,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:35,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:35,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:35,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:35,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:35,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:35,842 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:35,843 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:35,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:35,844 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,846 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,848 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:35,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:35,852 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:35,852 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:35,852 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-04-26 16:56:35,857 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,858 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:35,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:35,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:35,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:35,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:35,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:35,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:35,917 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,917 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:35,917 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 196 states and 368 transitions. cyclomatic complexity: 202 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:36,002 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 196 states and 368 transitions. cyclomatic complexity: 202. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 519 states and 1018 transitions. Complement of second has 7 states. [2025-04-26 16:56:36,002 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,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-26 16:56:36,003 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:36,003 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,003 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:36,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:36,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 519 states and 1018 transitions. [2025-04-26 16:56:36,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-04-26 16:56:36,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 519 states to 12 states and 14 transitions. [2025-04-26 16:56:36,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:56:36,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-04-26 16:56:36,011 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2025-04-26 16:56:36,011 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:36,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-04-26 16:56:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2025-04-26 16:56:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-04-26 16:56:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (in total 14), 11 states have internal predecessors, (14), 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,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-04-26 16:56:36,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-04-26 16:56:36,012 INFO L438 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-04-26 16:56:36,012 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:36,012 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-04-26 16:56:36,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-04-26 16:56:36,012 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:36,012 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:36,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:36,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:36,014 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[72] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[74] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:36,014 INFO L754 eck$LassoCheckResult]: Loop: "[77] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[79] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[80] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 16:56:36,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 92451467, now seen corresponding path program 1 times [2025-04-26 16:56:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557049383] [2025-04-26 16:56:36,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:36,019 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,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,058 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,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:36,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557049383] [2025-04-26 16:56:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557049383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742344069] [2025-04-26 16:56:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:36,062 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:36,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash 106317, now seen corresponding path program 1 times [2025-04-26 16:56:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:36,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012254783] [2025-04-26 16:56:36,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:36,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:36,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:36,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:36,082 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,082 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:36,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:36,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,082 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,103 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,103 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:36,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:36,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:36,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:36,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:36,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:36,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:36,214 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:36,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:36,219 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:36,219 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:36,219 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:36,219 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:36,219 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:36,219 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,219 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:36,219 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:36,219 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:36,219 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:36,220 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:36,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:36,245 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:36,246 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:36,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,261 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:36,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:36,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:36,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:36,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:36,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:36,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:36,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:36,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:36,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:36,278 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:36,278 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:36,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:36,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:36,295 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:36,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:36,297 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:36,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:56:36,326 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:36,326 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:36,326 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-04-26 16:56:36,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:36,332 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:36,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:36,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:36,351 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,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:36,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:36,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:36,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:36,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:36,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:36,389 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,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:36,389 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,406 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 16 states and 18 transitions. Complement of second has 6 states. [2025-04-26 16:56:36,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-04-26 16:56:36,409 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:36,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,409 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:36,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,409 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:36,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:36,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2025-04-26 16:56:36,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2025-04-26 16:56:36,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:36,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:36,410 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,410 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:36,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:36,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:36,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:36,412 INFO L87 Difference]: Start difference. First operand 0 states and 0 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,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:36,414 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:56:36,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:56:36,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:36,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:36,414 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,414 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:36,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:56:36,416 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:36,416 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:36,416 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:36,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:36,416 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:36,427 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,428 INFO L201 PluginConnector]: Adding new model c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:36 BoogieIcfgContainer [2025-04-26 16:56:36,428 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:36,429 INFO L158 Benchmark]: Toolchain (without parser) took 2177.51ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 37.5MB in the end (delta: 47.2MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,429 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.86ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.39ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,431 INFO L158 Benchmark]: Boogie Preprocessor took 15.57ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 82.0MB in the end (delta: 867.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:36,431 INFO L158 Benchmark]: RCFGBuilder took 163.97ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 72.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,432 INFO L158 Benchmark]: BuchiAutomizer took 1957.47ms. Allocated memory is still 155.2MB. Free memory was 72.5MB in the beginning and 37.5MB in the end (delta: 34.9MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:36,433 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.86ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.39ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.57ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 82.0MB in the end (delta: 867.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 163.97ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 72.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1957.47ms. Allocated memory is still 155.2MB. Free memory was 72.5MB in the beginning and 37.5MB in the end (delta: 34.9MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 51 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 60ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 249, Number of transitions in reduction automaton: 211, Number of states in reduction automaton: 123, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:36,446 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...