/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/clock2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:38,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:38,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:38,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:38,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:38,769 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:38,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:38,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:38,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:38,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:38,785 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:38,785 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:38,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:38,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:38,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:38,787 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:38,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:38,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:38,788 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:38,788 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:39,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:39,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:39,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:39,021 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:39,021 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:39,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/clock2.c.bpl [2025-04-26 16:56:39,022 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/clock2.c.bpl' [2025-04-26 16:56:39,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:39,033 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:39,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:39,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:39,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:39,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,065 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:39,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:39,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:39,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:39,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:39,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:39,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:39,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:39,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:39,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:39,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,118 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:39,123 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:39,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:39,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:39,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:39,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:39,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:39,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:39,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:39,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:39,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:39,141 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:39,177 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:39,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:39,232 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:39,232 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:39,245 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:39,246 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:39,246 INFO L201 PluginConnector]: Adding new model clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:39 BoogieIcfgContainer [2025-04-26 16:56:39,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:39,247 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:39,247 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:39,251 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:39,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:39,251 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/2) ... [2025-04-26 16:56:39,252 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e40d14 and model type clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:39, skipping insertion in model container [2025-04-26 16:56:39,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:39,252 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:39" (2/2) ... [2025-04-26 16:56:39,254 INFO L376 chiAutomizerObserver]: Analyzing ICFG clock2.c.bpl [2025-04-26 16:56:39,294 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:39,334 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:39,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:39,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,336 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:39,337 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:39,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 24 transitions, 62 flow [2025-04-26 16:56:39,397 INFO L116 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-04-26 16:56:39,401 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:39,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 3/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:56:39,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 24 transitions, 62 flow [2025-04-26 16:56:39,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 52 flow [2025-04-26 16:56:39,408 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 24 places, 20 transitions, 52 flow [2025-04-26 16:56:39,413 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:39,506 WARN L140 AmpleReduction]: Number of pruned transitions: 26 [2025-04-26 16:56:39,507 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:39,507 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 16:56:39,507 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 16:56:39,507 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:24 [2025-04-26 16:56:39,507 WARN L145 AmpleReduction]: Times succ was already a loop node:13 [2025-04-26 16:56:39,507 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:7 [2025-04-26 16:56:39,507 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:39,509 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 65 states, 64 states have (on average 1.6875) internal successors, (in total 108), 64 states have internal predecessors, (108), 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:39,514 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:39,514 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:39,514 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:39,514 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:39,514 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:39,514 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:39,514 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:39,514 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:39,516 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.6875) internal successors, (in total 108), 64 states have internal predecessors, (108), 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:39,524 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-04-26 16:56:39,524 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:39,524 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:39,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:56:39,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:39,528 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:39,528 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 64 states have (on average 1.6875) internal successors, (in total 108), 64 states have internal predecessors, (108), 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:39,532 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-04-26 16:56:39,532 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:39,532 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:39,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:56:39,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:39,535 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:39,536 INFO L754 eck$LassoCheckResult]: Loop: "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[60] L30-->L30-2: Formula: (<= v_x2_3 v_x1_6) InVars {x1=v_x1_6, x2=v_x2_3} OutVars{x1=v_x1_6, x2=v_x2_3} AuxVars[] AssignedVars[]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:39,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2025-04-26 16:56:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:39,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273415036] [2025-04-26 16:56:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:39,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:56:39,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:56:39,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:39,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:56:39,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:56:39,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:39,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash 81178553, now seen corresponding path program 1 times [2025-04-26 16:56:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:39,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603886015] [2025-04-26 16:56:39,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:39,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:39,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:39,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,610 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:39,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:39,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:39,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:39,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1322244492, now seen corresponding path program 1 times [2025-04-26 16:56:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:39,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670778419] [2025-04-26 16:56:39,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:39,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:39,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:39,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:39,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:39,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:39,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:39,707 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:39,707 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:39,707 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:39,707 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:39,708 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:39,708 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:39,708 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:39,708 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:39,708 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:39,708 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:39,709 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:39,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:39,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:39,817 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:39,817 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:39,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:39,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,821 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:39,823 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:39,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:39,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:39,844 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:39,844 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:39,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:39,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:39,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,853 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:39,854 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:39,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:39,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:39,874 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:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:39,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,877 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:39,879 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:39,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:39,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:39,987 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:39,992 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:39,993 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:39,993 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:39,993 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:39,993 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:39,993 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:39,993 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:39,993 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:39,993 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:39,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:39,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:39,993 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:39,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,050 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,054 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:40,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:40,062 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:40,063 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:40,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:40,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:40,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:40,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:40,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:40,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:40,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:40,095 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:40,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:56:40,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,106 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:40,108 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:40,109 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:40,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:40,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:40,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:40,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:40,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:40,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:40,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:40,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:40,140 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:40,141 INFO L437 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,147 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:40,149 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:40,151 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:40,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:40,155 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:40,155 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:40,155 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:56:40,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:40,165 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:40,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:56:40,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:56:40,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:40,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,253 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:40,269 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:40,271 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.6875) internal successors, (in total 108), 64 states have internal predecessors, (108), 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.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:40,339 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65 states, 64 states have (on average 1.6875) internal successors, (in total 108), 64 states have internal predecessors, (108), 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.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 156 states and 293 transitions. Complement of second has 6 states. [2025-04-26 16:56:40,340 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:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:56:40,348 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 5 letters. [2025-04-26 16:56:40,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 16:56:40,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 10 letters. [2025-04-26 16:56:40,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 293 transitions. [2025-04-26 16:56:40,357 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:40,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 89 states and 181 transitions. [2025-04-26 16:56:40,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 16:56:40,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 16:56:40,361 INFO L74 IsDeterministic]: Start isDeterministic. Operand 89 states and 181 transitions. [2025-04-26 16:56:40,362 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:40,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 181 transitions. [2025-04-26 16:56:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 181 transitions. [2025-04-26 16:56:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2025-04-26 16:56:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.0135135135135136) internal successors, (in total 149), 73 states have internal predecessors, (149), 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:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 149 transitions. [2025-04-26 16:56:40,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 149 transitions. [2025-04-26 16:56:40,383 INFO L438 stractBuchiCegarLoop]: Abstraction has 74 states and 149 transitions. [2025-04-26 16:56:40,383 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:40,383 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 149 transitions. [2025-04-26 16:56:40,386 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:40,386 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:40,386 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:40,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:40,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:40,387 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[74] L13-->L41: 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:40,387 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:40,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 99801, now seen corresponding path program 1 times [2025-04-26 16:56:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284195962] [2025-04-26 16:56:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 1 times [2025-04-26 16:56:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675278010] [2025-04-26 16:56:40,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1975978300, now seen corresponding path program 1 times [2025-04-26 16:56:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507112497] [2025-04-26 16:56:40,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:40,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:40,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,438 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,438 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:40,439 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,439 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,439 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,439 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:40,439 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,439 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,473 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,473 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:40,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,475 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:40,476 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:40,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:40,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:40,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,497 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:40,497 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:40,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:40,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,567 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:40,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:40,574 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,574 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,574 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,574 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,574 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:40,574 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,575 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,575 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,575 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:40,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,575 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,606 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,607 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:40,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,609 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:40,609 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:40,610 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:40,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:40,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:40,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:40,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:40,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:40,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:40,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:40,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:40,625 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:40,625 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,627 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:40,628 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:40,629 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:40,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:40,633 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:40,633 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:40,633 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:56:40,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:56:40,640 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:40,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,699 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:40,699 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:40,699 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 149 transitions. cyclomatic complexity: 84 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:40,766 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 149 transitions. cyclomatic complexity: 84. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 242 states and 498 transitions. Complement of second has 7 states. [2025-04-26 16:56:40,768 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:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 16:56:40,769 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:40,769 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,769 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:56:40,769 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,769 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:56:40,769 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 498 transitions. [2025-04-26 16:56:40,773 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:40,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 164 states and 348 transitions. [2025-04-26 16:56:40,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 16:56:40,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-04-26 16:56:40,777 INFO L74 IsDeterministic]: Start isDeterministic. Operand 164 states and 348 transitions. [2025-04-26 16:56:40,777 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:40,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 348 transitions. [2025-04-26 16:56:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 348 transitions. [2025-04-26 16:56:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-04-26 16:56:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.127388535031847) internal successors, (in total 334), 156 states have internal predecessors, (334), 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:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 334 transitions. [2025-04-26 16:56:40,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 334 transitions. [2025-04-26 16:56:40,788 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 334 transitions. [2025-04-26 16:56:40,788 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:40,788 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 334 transitions. [2025-04-26 16:56:40,789 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:40,789 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:40,789 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:40,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:40,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:40,790 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:40,790 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:40,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1960107130, now seen corresponding path program 1 times [2025-04-26 16:56:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709846166] [2025-04-26 16:56:40,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:40,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:40,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:40,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:40,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 2 times [2025-04-26 16:56:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515348387] [2025-04-26 16:56:40,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:40,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 232531805, now seen corresponding path program 1 times [2025-04-26 16:56:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952122895] [2025-04-26 16:56:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:40,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:40,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,875 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:40,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:40,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952122895] [2025-04-26 16:56:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952122895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:40,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722987429] [2025-04-26 16:56:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:40,902 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,903 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,903 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,903 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,903 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:40,903 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,903 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,903 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,903 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:40,903 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,903 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,932 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,932 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:40,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,935 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:40,937 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:40,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:40,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,949 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:40,949 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:40,955 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:40,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,957 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:40,958 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:40,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:40,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,976 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:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,978 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:40,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:40,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:40,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,044 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:41,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:41,049 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:41,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:41,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:41,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:41,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:41,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:41,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:41,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:41,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:41,049 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:41,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,084 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,085 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:41,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,087 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:41,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:41,091 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:41,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:41,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:41,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:41,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:41,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:41,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:41,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:41,104 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:41,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:41,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,112 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:41,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:41,113 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:41,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:41,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:41,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:41,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:41,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:41,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:41,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:41,129 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:41,132 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:41,133 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,135 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:41,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:41,137 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:41,140 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:41,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:41,141 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:41,141 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:41,141 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:56:41,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:41,148 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:41,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:41,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:41,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:41,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:41,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:41,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:41,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:41,222 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:41,223 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:41,223 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 334 transitions. cyclomatic complexity: 194 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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:41,286 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 334 transitions. cyclomatic complexity: 194. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 666 states and 1414 transitions. Complement of second has 7 states. [2025-04-26 16:56:41,287 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:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:56:41,288 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:56:41,288 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,288 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:56:41,288 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,288 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:56:41,288 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 1414 transitions. [2025-04-26 16:56:41,294 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:41,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 464 states and 980 transitions. [2025-04-26 16:56:41,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 16:56:41,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-04-26 16:56:41,298 INFO L74 IsDeterministic]: Start isDeterministic. Operand 464 states and 980 transitions. [2025-04-26 16:56:41,299 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:41,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 464 states and 980 transitions. [2025-04-26 16:56:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 980 transitions. [2025-04-26 16:56:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 274. [2025-04-26 16:56:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 274 states have (on average 2.105839416058394) internal successors, (in total 577), 273 states have internal predecessors, (577), 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:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 577 transitions. [2025-04-26 16:56:41,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 274 states and 577 transitions. [2025-04-26 16:56:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:41,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:41,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:41,314 INFO L87 Difference]: Start difference. First operand 274 states and 577 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:41,326 INFO L93 Difference]: Finished difference Result 166 states and 287 transitions. [2025-04-26 16:56:41,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 287 transitions. [2025-04-26 16:56:41,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 16:56:41,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 149 states and 254 transitions. [2025-04-26 16:56:41,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-04-26 16:56:41,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-04-26 16:56:41,329 INFO L74 IsDeterministic]: Start isDeterministic. Operand 149 states and 254 transitions. [2025-04-26 16:56:41,329 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:41,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 254 transitions. [2025-04-26 16:56:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 254 transitions. [2025-04-26 16:56:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2025-04-26 16:56:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 1.7185185185185186) internal successors, (in total 232), 134 states have internal predecessors, (232), 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:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 232 transitions. [2025-04-26 16:56:41,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 135 states and 232 transitions. [2025-04-26 16:56:41,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:41,339 INFO L438 stractBuchiCegarLoop]: Abstraction has 135 states and 232 transitions. [2025-04-26 16:56:41,339 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:41,339 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 232 transitions. [2025-04-26 16:56:41,340 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 16:56:41,340 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:41,340 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:41,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-04-26 16:56:41,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:41,341 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[54] L22-->thread1FINAL: Formula: (<= v_z_2 v_x1_7) InVars {x1=v_x1_7, z=v_z_2} OutVars{x1=v_x1_7, z=v_z_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:41,341 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:41,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1016682322, now seen corresponding path program 1 times [2025-04-26 16:56:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:41,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313908109] [2025-04-26 16:56:41,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:41,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:41,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:41,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313908109] [2025-04-26 16:56:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313908109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:56:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863573551] [2025-04-26 16:56:41,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:41,380 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:41,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 3 times [2025-04-26 16:56:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:41,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665338547] [2025-04-26 16:56:41,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:41,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:41,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:41,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:41,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:41,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:41,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:41,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:41,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:41,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:41,414 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:41,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:41,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:41,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:41,414 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:41,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:41,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:41,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:41,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:41,414 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:41,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,456 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,456 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:41,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,458 INFO L229 MonitoredProcess]: Starting monitored process 19 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:41,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:41,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:41,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:56:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,478 INFO L229 MonitoredProcess]: Starting monitored process 20 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:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:41,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:41,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,542 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:41,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:41,546 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:41,546 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:41,546 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:41,546 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:41,546 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:41,546 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:41,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:41,547 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:41,547 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:41,547 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:41,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,573 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,573 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:41,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,575 INFO L229 MonitoredProcess]: Starting monitored process 21 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:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:41,577 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:41,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:41,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:41,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:41,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:41,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:41,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:41,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:41,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:41,591 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:41,591 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:41,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,593 INFO L229 MonitoredProcess]: Starting monitored process 22 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:41,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:56:41,594 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:41,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:56:41,597 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:41,597 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:41,597 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:56:41,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:56:41,604 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:41,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:41,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:41,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:41,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:41,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:41,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:41,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:41,690 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:41,691 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:41,691 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 135 states and 232 transitions. cyclomatic complexity: 114 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:41,712 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 135 states and 232 transitions. cyclomatic complexity: 114. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 160 states and 266 transitions. Complement of second has 6 states. [2025-04-26 16:56:41,713 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:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-04-26 16:56:41,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:56:41,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:41,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 16:56:41,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 266 transitions. [2025-04-26 16:56:41,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:41,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 123 states and 216 transitions. [2025-04-26 16:56:41,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 16:56:41,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-04-26 16:56:41,719 INFO L74 IsDeterministic]: Start isDeterministic. Operand 123 states and 216 transitions. [2025-04-26 16:56:41,719 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:41,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 123 states and 216 transitions. [2025-04-26 16:56:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 216 transitions. [2025-04-26 16:56:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-04-26 16:56:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.7560975609756098) internal successors, (in total 216), 122 states have internal predecessors, (216), 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:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 216 transitions. [2025-04-26 16:56:41,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 216 transitions. [2025-04-26 16:56:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:41,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:41,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:41,723 INFO L87 Difference]: Start difference. First operand 123 states and 216 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 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:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:41,760 INFO L93 Difference]: Finished difference Result 235 states and 360 transitions. [2025-04-26 16:56:41,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 360 transitions. [2025-04-26 16:56:41,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:41,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 179 states and 264 transitions. [2025-04-26 16:56:41,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 16:56:41,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 16:56:41,765 INFO L74 IsDeterministic]: Start isDeterministic. Operand 179 states and 264 transitions. [2025-04-26 16:56:41,765 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:41,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 179 states and 264 transitions. [2025-04-26 16:56:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 264 transitions. [2025-04-26 16:56:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 143. [2025-04-26 16:56:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 1.5384615384615385) internal successors, (in total 220), 142 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2025-04-26 16:56:41,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 143 states and 220 transitions. [2025-04-26 16:56:41,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:41,771 INFO L438 stractBuchiCegarLoop]: Abstraction has 143 states and 220 transitions. [2025-04-26 16:56:41,771 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:41,771 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 220 transitions. [2025-04-26 16:56:41,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:41,772 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:41,772 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:41,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:41,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:41,772 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[74] L13-->L41: 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]" "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:41,772 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:41,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -487178308, now seen corresponding path program 1 times [2025-04-26 16:56:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:41,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262891702] [2025-04-26 16:56:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:41,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:41,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:41,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:41,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262891702] [2025-04-26 16:56:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262891702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:41,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:41,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:56:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841156088] [2025-04-26 16:56:41,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:41,822 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:41,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 4 times [2025-04-26 16:56:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:41,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074443324] [2025-04-26 16:56:41,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:41,825 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:56:41,827 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:41,827 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:41,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:41,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:41,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:41,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:41,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:41,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:41,853 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:41,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:41,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:41,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:41,853 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:41,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:41,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:41,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:56:41,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:41,854 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:41,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,880 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,880 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:41,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,882 INFO L229 MonitoredProcess]: Starting monitored process 23 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:41,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:56:41,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:41,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,902 INFO L229 MonitoredProcess]: Starting monitored process 24 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:41,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:56:41,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:41,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,967 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:41,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:56:41,971 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:41,971 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:41,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:41,972 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:41,972 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:41,972 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,972 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:41,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:41,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:56:41,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:41,972 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:41,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,998 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,998 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:41,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:42,000 INFO L229 MonitoredProcess]: Starting monitored process 25 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:42,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:56:42,002 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:42,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:42,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:42,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:42,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:42,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:42,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:42,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:42,014 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:42,015 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:42,015 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:42,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:42,047 INFO L229 MonitoredProcess]: Starting monitored process 26 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:42,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:56:42,049 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:42,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:56:42,052 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:42,052 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:42,052 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:56:42,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:56:42,059 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:42,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:42,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:42,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:42,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:42,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:42,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:42,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:42,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:42,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:42,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:42,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:42,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:42,130 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:42,131 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:42,131 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 220 transitions. cyclomatic complexity: 83 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:42,165 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 220 transitions. cyclomatic complexity: 83. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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 188 states and 292 transitions. Complement of second has 7 states. [2025-04-26 16:56:42,168 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:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 16:56:42,169 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:42,169 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:42,169 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:42,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:42,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:42,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:42,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:42,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:42,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:42,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:42,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:42,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:42,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:42,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:42,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:42,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:42,251 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:42,251 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:42,251 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 220 transitions. cyclomatic complexity: 83 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:42,297 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 220 transitions. cyclomatic complexity: 83. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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 189 states and 295 transitions. Complement of second has 9 states. [2025-04-26 16:56:42,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-04-26 16:56:42,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:42,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:42,300 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:42,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:42,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:42,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:42,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:42,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:42,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:42,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:42,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:42,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:42,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:42,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:42,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:42,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:42,376 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:42,377 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:42,377 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 220 transitions. cyclomatic complexity: 83 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:42,418 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 220 transitions. cyclomatic complexity: 83. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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 444 states and 661 transitions. Complement of second has 17 states. [2025-04-26 16:56:42,419 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:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-26 16:56:42,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:42,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:42,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:42,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:42,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:56:42,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:42,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 444 states and 661 transitions. [2025-04-26 16:56:42,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:42,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 444 states to 0 states and 0 transitions. [2025-04-26 16:56:42,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:42,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:42,424 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:42,424 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:42,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:42,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:42,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:42,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:42,425 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:42,425 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:56:42,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:56:42,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:42,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:56:42,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:42,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:42,426 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:42,426 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:42,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:42,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:42,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:56:42,426 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:42,426 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:42,426 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:42,426 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:42,426 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:42,437 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:42,438 INFO L201 PluginConnector]: Adding new model clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:42 BoogieIcfgContainer [2025-04-26 16:56:42,439 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:42,439 INFO L158 Benchmark]: Toolchain (without parser) took 3405.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 83.9MB in the beginning and 43.6MB in the end (delta: 40.3MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2025-04-26 16:56:42,440 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:42,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:42,440 INFO L158 Benchmark]: Boogie Preprocessor took 24.40ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 81.0MB in the end (delta: 983.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:42,440 INFO L158 Benchmark]: RCFGBuilder took 152.46ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 72.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:42,441 INFO L158 Benchmark]: BuchiAutomizer took 3191.90ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.8MB in the beginning and 43.6MB in the end (delta: 28.2MB). Peak memory consumption was 28.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:42,442 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.15ms. Allocated memory is still 159.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.40ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 81.0MB in the end (delta: 983.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 152.46ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 72.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3191.90ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.8MB in the beginning and 43.6MB in the end (delta: 28.2MB). Peak memory consumption was 28.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 262 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 106 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp67 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 177, Number of transitions in reduction automaton: 108, Number of states in reduction automaton: 65, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One nondeterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. 3 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:42,457 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...