/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:27,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:27,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:27,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:27,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:27,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:27,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:27,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:27,263 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:27,263 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:27,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:27,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:27,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:27,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:27,264 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:27,265 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:27,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:27,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:27,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:27,479 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:27,480 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:27,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl [2025-02-17 22:45:27,481 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/clock2-buggy.c.bpl' [2025-02-17 22:45:27,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:27,497 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:27,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:27,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:27,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:27,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,516 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:27,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:27,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:27,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:27,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:27,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:27,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:27,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:27,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:27,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/1) ... [2025-02-17 22:45:27,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,555 INFO L229 MonitoredProcess]: Starting monitored process 1 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-02-17 22:45:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:45:27,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:27,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:27,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:27,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:27,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:27,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:27,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:27,580 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:27,617 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:27,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:27,689 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:27,690 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:27,703 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:27,703 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:27,704 INFO L201 PluginConnector]: Adding new model clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:27 BoogieIcfgContainer [2025-02-17 22:45:27,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:27,704 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:27,704 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:27,710 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:27,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:27,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:27" (1/2) ... [2025-02-17 22:45:27,712 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f1256b0 and model type clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:27, skipping insertion in model container [2025-02-17 22:45:27,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:27,712 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:27" (2/2) ... [2025-02-17 22:45:27,713 INFO L363 chiAutomizerObserver]: Analyzing ICFG clock2-buggy.c.bpl [2025-02-17 22:45:27,769 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:27,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 60 flow [2025-02-17 22:45:27,828 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-02-17 22:45:27,830 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:27,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-17 22:45:27,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 23 transitions, 60 flow [2025-02-17 22:45:27,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 19 transitions, 50 flow [2025-02-17 22:45:27,849 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:27,850 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:27,850 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:27,850 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:27,850 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:27,850 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:27,850 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:27,850 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:27,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:27,881 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 55 [2025-02-17 22:45:27,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:27,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:27,885 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:27,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 65 states, but on-demand construction may add more states [2025-02-17 22:45:27,888 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 55 [2025-02-17 22:45:27,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:27,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:27,894 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:27,894 INFO L754 eck$LassoCheckResult]: Loop: "[49] 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[]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2025-02-17 22:45:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681718515] [2025-02-17 22:45:27,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:27,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:27,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:27,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:27,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 75452690, now seen corresponding path program 1 times [2025-02-17 22:45:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612509428] [2025-02-17 22:45:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:27,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:27,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1528374412, now seen corresponding path program 1 times [2025-02-17 22:45:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631748764] [2025-02-17 22:45:28,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:28,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:28,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:28,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:28,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,141 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,142 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,142 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,142 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,142 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:28,142 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,142 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,142 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:28,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,143 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,243 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:28,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,247 INFO L229 MonitoredProcess]: Starting monitored process 2 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-02-17 22:45:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:45:28,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:28,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:45:28,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,314 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-02-17 22:45:28,316 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-02-17 22:45:28,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:28,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:28,396 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:28,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:45:28,401 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,401 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,401 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,401 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,401 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:28,401 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,401 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,401 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,401 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:28,401 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,401 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,484 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:28,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,486 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-02-17 22:45:28,488 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-02-17 22:45:28,488 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-02-17 22:45:28,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:28,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:28,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:28,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:28,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:28,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:28,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:28,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:28,514 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:28,514 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:28,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,518 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-02-17 22:45:28,520 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-02-17 22:45:28,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:28,521 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:28,537 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:28,538 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:45:28,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:28,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:45:28,550 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:28,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:28,706 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-02-17 22:45:28,710 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 65 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 65 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 194 states and 384 transitions. Complement of second has 7 states. [2025-02-17 22:45:28,847 INFO L141 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-02-17 22:45:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-02-17 22:45:28,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 1 letters. Loop has 5 letters. [2025-02-17 22:45:28,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 6 letters. Loop has 5 letters. [2025-02-17 22:45:28,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 1 letters. Loop has 10 letters. [2025-02-17 22:45:28,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 384 transitions. [2025-02-17 22:45:28,866 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2025-02-17 22:45:28,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 130 states and 262 transitions. [2025-02-17 22:45:28,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-02-17 22:45:28,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-02-17 22:45:28,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 262 transitions. [2025-02-17 22:45:28,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:28,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 262 transitions. [2025-02-17 22:45:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 262 transitions. [2025-02-17 22:45:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2025-02-17 22:45:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 2.046728971962617) internal successors, (219), 106 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 219 transitions. [2025-02-17 22:45:28,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 219 transitions. [2025-02-17 22:45:28,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 107 states and 219 transitions. [2025-02-17 22:45:28,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:28,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 219 transitions. [2025-02-17 22:45:28,898 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2025-02-17 22:45:28,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:28,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:28,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:28,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:28,899 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[48] L22-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[67] L13-->L38: 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-02-17 22:45:28,899 INFO L754 eck$LassoCheckResult]: Loop: "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 92850, now seen corresponding path program 1 times [2025-02-17 22:45:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691190441] [2025-02-17 22:45:28,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 82132825, now seen corresponding path program 1 times [2025-02-17 22:45:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622486449] [2025-02-17 22:45:28,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -314582200, now seen corresponding path program 1 times [2025-02-17 22:45:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544683611] [2025-02-17 22:45:28,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:28,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:28,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:28,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:28,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:28,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:28,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:28,974 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:28,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:28,974 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:28,974 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:28,974 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:28,974 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,974 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:28,974 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:28,974 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:28,974 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:28,974 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:28,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,022 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:29,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,024 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-02-17 22:45:29,026 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-02-17 22:45:29,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:29,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,050 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-02-17 22:45:29,051 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-02-17 22:45:29,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,078 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:29,078 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=-1}, {x1=7}, {x1=-7}] Lambdas: [1, 2, 1] Nus: [0, 1] [2025-02-17 22:45:29,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:45:29,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,091 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-02-17 22:45:29,092 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-02-17 22:45:29,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:45:29,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,113 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-02-17 22:45:29,114 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-02-17 22:45:29,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,191 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:45:29,196 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,196 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:29,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,250 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,250 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,298 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-02-17 22:45:29,299 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-02-17 22:45:29,300 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-02-17 22:45:29,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:29,319 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-02-17 22:45:29,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,321 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-02-17 22:45:29,323 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-02-17 22:45:29,323 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-02-17 22:45:29,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:29,343 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:29,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,345 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-02-17 22:45:29,347 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-02-17 22:45:29,351 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,352 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,352 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:45:29,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:29,358 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:29,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:29,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:29,422 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-02-17 22:45:29,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 219 transitions. cyclomatic complexity: 123 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 219 transitions. cyclomatic complexity: 123. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 338 states and 689 transitions. Complement of second has 7 states. [2025-02-17 22:45:29,467 INFO L141 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-02-17 22:45:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-02-17 22:45:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 3 letters. Loop has 5 letters. [2025-02-17 22:45:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 8 letters. Loop has 5 letters. [2025-02-17 22:45:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 3 letters. Loop has 10 letters. [2025-02-17 22:45:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 689 transitions. [2025-02-17 22:45:29,472 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2025-02-17 22:45:29,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 264 states and 526 transitions. [2025-02-17 22:45:29,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2025-02-17 22:45:29,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2025-02-17 22:45:29,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 526 transitions. [2025-02-17 22:45:29,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 264 states and 526 transitions. [2025-02-17 22:45:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 526 transitions. [2025-02-17 22:45:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2025-02-17 22:45:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 240 states have (on average 2.0208333333333335) internal successors, (485), 239 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 485 transitions. [2025-02-17 22:45:29,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 240 states and 485 transitions. [2025-02-17 22:45:29,486 INFO L432 stractBuchiCegarLoop]: Abstraction has 240 states and 485 transitions. [2025-02-17 22:45:29,486 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:29,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 240 states and 485 transitions. [2025-02-17 22:45:29,488 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2025-02-17 22:45:29,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:29,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:29,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:29,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:29,488 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[49] 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[]" "[67] L13-->L38: 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]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[48] L22-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:45:29,490 INFO L754 eck$LassoCheckResult]: Loop: "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:29,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 568119165, now seen corresponding path program 1 times [2025-02-17 22:45:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458075098] [2025-02-17 22:45:29,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:29,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:29,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash 82132825, now seen corresponding path program 2 times [2025-02-17 22:45:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595098788] [2025-02-17 22:45:29,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:29,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:29,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:29,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1152729763, now seen corresponding path program 1 times [2025-02-17 22:45:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383746040] [2025-02-17 22:45:29,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:45:29,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:45:29,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:29,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:45:29,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:45:29,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:29,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:29,554 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,554 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:29,554 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,554 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,554 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,554 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:29,554 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,554 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,602 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,602 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:29,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,604 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-02-17 22:45:29,605 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-02-17 22:45:29,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,620 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-02-17 22:45:29,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,622 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-02-17 22:45:29,623 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-02-17 22:45:29,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,646 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:29,646 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=-1}, {x1=7}, {x1=-7}] Lambdas: [1, 2, 1] Nus: [0, 1] [2025-02-17 22:45:29,651 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-02-17 22:45:29,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,653 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-02-17 22:45:29,654 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-02-17 22:45:29,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,666 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:29,666 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:29,671 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-02-17 22:45:29,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,673 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-02-17 22:45:29,673 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-02-17 22:45:29,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:29,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,689 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-02-17 22:45:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,691 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-02-17 22:45:29,692 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-02-17 22:45:29,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:29,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:29,753 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:29,757 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-02-17 22:45:29,757 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:29,757 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:29,757 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:29,757 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:29,757 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:29,757 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,757 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:29,757 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:29,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:29,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:29,757 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:29,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:29,797 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:29,797 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:29,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,799 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-02-17 22:45:29,800 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-02-17 22:45:29,801 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-02-17 22:45:29,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:29,820 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-02-17 22:45:29,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,822 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-02-17 22:45:29,822 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-02-17 22:45:29,823 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-02-17 22:45:29,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:29,840 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-02-17 22:45:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,842 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-02-17 22:45:29,843 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-02-17 22:45:29,844 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-02-17 22:45:29,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:29,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:29,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:29,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:29,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:29,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:29,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:29,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:29,858 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:29,858 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:29,860 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-02-17 22:45:29,861 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-02-17 22:45:29,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:29,862 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:29,862 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:29,862 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:45:29,867 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-02-17 22:45:29,867 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:29,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:29,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:29,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:29,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:29,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:29,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:29,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:29,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:29,940 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-02-17 22:45:29,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 240 states and 485 transitions. cyclomatic complexity: 261 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 240 states and 485 transitions. cyclomatic complexity: 261. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 283 states and 571 transitions. Complement of second has 6 states. [2025-02-17 22:45:29,970 INFO L141 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-02-17 22:45:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-02-17 22:45:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 5 letters. [2025-02-17 22:45:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 13 letters. Loop has 5 letters. [2025-02-17 22:45:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 10 letters. [2025-02-17 22:45:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:29,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 571 transitions. [2025-02-17 22:45:29,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-02-17 22:45:29,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 225 states and 451 transitions. [2025-02-17 22:45:29,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2025-02-17 22:45:29,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-02-17 22:45:29,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 451 transitions. [2025-02-17 22:45:29,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:29,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 225 states and 451 transitions. [2025-02-17 22:45:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 451 transitions. [2025-02-17 22:45:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-17 22:45:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 225 states have (on average 2.0044444444444443) internal successors, (451), 224 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 451 transitions. [2025-02-17 22:45:29,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 225 states and 451 transitions. [2025-02-17 22:45:29,990 INFO L432 stractBuchiCegarLoop]: Abstraction has 225 states and 451 transitions. [2025-02-17 22:45:29,990 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:29,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 451 transitions. [2025-02-17 22:45:29,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-02-17 22:45:29,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:29,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:29,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:29,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:29,992 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L13-->L38: 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]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[55] L38-->thread2FINAL: Formula: (<= v_z_3 v_x2_5) InVars {x2=v_x2_5, z=v_z_3} OutVars{x2=v_x2_5, z=v_z_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:29,992 INFO L754 eck$LassoCheckResult]: Loop: "[49] 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[]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:29,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash -944924287, now seen corresponding path program 1 times [2025-02-17 22:45:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:29,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470383459] [2025-02-17 22:45:29,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:29,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:30,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:30,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:30,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash 75452690, now seen corresponding path program 2 times [2025-02-17 22:45:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002773271] [2025-02-17 22:45:30,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:30,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -254433390, now seen corresponding path program 1 times [2025-02-17 22:45:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620419822] [2025-02-17 22:45:30,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:45:30,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:45:30,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:45:30,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:45:30,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,054 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:30,054 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:30,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:30,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:30,054 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:30,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:30,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:30,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:30,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:30,054 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:30,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,099 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:30,099 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,101 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-02-17 22:45:30,101 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-02-17 22:45:30,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:30,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:30,117 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-02-17 22:45:30,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,119 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-02-17 22:45:30,120 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-02-17 22:45:30,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:30,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:30,143 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:30,143 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x2=0} Honda state: {x2=0} Generalized eigenvectors: [{x2=-8}, {x2=3}, {x2=4}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-02-17 22:45:30,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:30,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,151 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-02-17 22:45:30,152 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-02-17 22:45:30,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:30,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:30,168 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-02-17 22:45:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,170 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-02-17 22:45:30,171 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-02-17 22:45:30,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:30,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:30,234 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:30,238 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-02-17 22:45:30,238 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:30,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:30,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:30,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:30,239 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:30,239 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,239 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:30,239 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:30,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:30,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:30,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:30,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,251 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-02-17 22:45:30,255 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-02-17 22:45:30,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,301 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:30,301 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:30,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,303 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-02-17 22:45:30,303 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-02-17 22:45:30,304 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-02-17 22:45:30,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:30,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:30,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:30,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:30,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:30,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:30,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:30,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:30,327 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-02-17 22:45:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,330 INFO L229 MonitoredProcess]: Starting monitored process 27 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-02-17 22:45:30,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:45:30,333 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-02-17 22:45:30,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:30,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:30,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:30,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:30,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:30,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:30,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:30,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:30,347 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:30,347 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:30,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,350 INFO L229 MonitoredProcess]: Starting monitored process 28 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-02-17 22:45:30,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:45:30,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:30,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:30,352 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:30,352 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:45:30,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:30,360 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:30,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:30,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:30,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:30,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:30,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:30,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:30,439 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-02-17 22:45:30,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225 states and 451 transitions. cyclomatic complexity: 239 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225 states and 451 transitions. cyclomatic complexity: 239. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 256 states and 510 transitions. Complement of second has 6 states. [2025-02-17 22:45:30,470 INFO L141 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-02-17 22:45:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-02-17 22:45:30,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 5 letters. [2025-02-17 22:45:30,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 5 letters. [2025-02-17 22:45:30,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 10 letters. [2025-02-17 22:45:30,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 510 transitions. [2025-02-17 22:45:30,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-02-17 22:45:30,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 215 states and 426 transitions. [2025-02-17 22:45:30,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2025-02-17 22:45:30,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-02-17 22:45:30,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 426 transitions. [2025-02-17 22:45:30,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:30,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 426 transitions. [2025-02-17 22:45:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 426 transitions. [2025-02-17 22:45:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-17 22:45:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.9813953488372094) internal successors, (426), 214 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 426 transitions. [2025-02-17 22:45:30,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 215 states and 426 transitions. [2025-02-17 22:45:30,480 INFO L432 stractBuchiCegarLoop]: Abstraction has 215 states and 426 transitions. [2025-02-17 22:45:30,480 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:30,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 426 transitions. [2025-02-17 22:45:30,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-02-17 22:45:30,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:30,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:30,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:30,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:30,481 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[49] 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[]" "[67] L13-->L38: 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]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:30,481 INFO L754 eck$LassoCheckResult]: Loop: "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[49] 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[]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-02-17 22:45:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 501742054, now seen corresponding path program 1 times [2025-02-17 22:45:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290629085] [2025-02-17 22:45:30,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:30,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:30,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:30,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290629085] [2025-02-17 22:45:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290629085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:45:30,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723057646] [2025-02-17 22:45:30,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:30,529 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:30,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash 80009720, now seen corresponding path program 3 times [2025-02-17 22:45:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084207008] [2025-02-17 22:45:30,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:45:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,566 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:30,566 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:30,566 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:30,566 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:30,566 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:30,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:30,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:30,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:45:30,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:30,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:30,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,601 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:30,601 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,603 INFO L229 MonitoredProcess]: Starting monitored process 29 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-02-17 22:45:30,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:45:30,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:30,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:30,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-17 22:45:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,622 INFO L229 MonitoredProcess]: Starting monitored process 30 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-02-17 22:45:30,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-17 22:45:30,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:30,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:30,692 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:30,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-17 22:45:30,697 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:30,697 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:30,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:30,697 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:30,697 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:30,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:30,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:30,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:45:30,697 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:30,697 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:30,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,730 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:30,731 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:30,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,733 INFO L229 MonitoredProcess]: Starting monitored process 31 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-02-17 22:45:30,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-17 22:45:30,734 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-02-17 22:45:30,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:30,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:30,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:30,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:30,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:30,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:30,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:30,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:30,748 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:30,748 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:30,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:30,750 INFO L229 MonitoredProcess]: Starting monitored process 32 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-02-17 22:45:30,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-17 22:45:30,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:30,751 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:30,751 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:30,751 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:45:30,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-17 22:45:30,757 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:30,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:30,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:30,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:30,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:30,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:30,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:30,817 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-02-17 22:45:30,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 426 transitions. cyclomatic complexity: 222 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 426 transitions. cyclomatic complexity: 222. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 483 states and 951 transitions. Complement of second has 7 states. [2025-02-17 22:45:30,860 INFO L141 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-02-17 22:45:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-02-17 22:45:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 10 letters. Loop has 5 letters. [2025-02-17 22:45:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 15 letters. Loop has 5 letters. [2025-02-17 22:45:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 10 letters. Loop has 10 letters. [2025-02-17 22:45:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:30,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 951 transitions. [2025-02-17 22:45:30,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-02-17 22:45:30,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 464 states and 918 transitions. [2025-02-17 22:45:30,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2025-02-17 22:45:30,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2025-02-17 22:45:30,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 464 states and 918 transitions. [2025-02-17 22:45:30,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:30,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 464 states and 918 transitions. [2025-02-17 22:45:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 918 transitions. [2025-02-17 22:45:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 437. [2025-02-17 22:45:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 437 states have (on average 1.9908466819221968) internal successors, (870), 436 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 870 transitions. [2025-02-17 22:45:30,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 437 states and 870 transitions. [2025-02-17 22:45:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:30,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:30,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:30,885 INFO L87 Difference]: Start difference. First operand 437 states and 870 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:30,903 INFO L93 Difference]: Finished difference Result 256 states and 410 transitions. [2025-02-17 22:45:30,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 410 transitions. [2025-02-17 22:45:30,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-17 22:45:30,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 179 states and 297 transitions. [2025-02-17 22:45:30,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2025-02-17 22:45:30,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2025-02-17 22:45:30,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 297 transitions. [2025-02-17 22:45:30,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:30,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 179 states and 297 transitions. [2025-02-17 22:45:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 297 transitions. [2025-02-17 22:45:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2025-02-17 22:45:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 116 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 199 transitions. [2025-02-17 22:45:30,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 199 transitions. [2025-02-17 22:45:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:30,910 INFO L432 stractBuchiCegarLoop]: Abstraction has 117 states and 199 transitions. [2025-02-17 22:45:30,911 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:45:30,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 199 transitions. [2025-02-17 22:45:30,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-17 22:45:30,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:30,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:30,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:30,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:30,912 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[49] 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[]" "[67] L13-->L38: 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]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:30,912 INFO L754 eck$LassoCheckResult]: Loop: "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1488390345, now seen corresponding path program 1 times [2025-02-17 22:45:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393005659] [2025-02-17 22:45:30,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:45:30,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:45:30,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:45:30,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:45:30,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash 84964765, now seen corresponding path program 3 times [2025-02-17 22:45:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642847998] [2025-02-17 22:45:30,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:30,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:45:30,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2100844075, now seen corresponding path program 2 times [2025-02-17 22:45:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439706384] [2025-02-17 22:45:30,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:30,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-17 22:45:30,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-17 22:45:30,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:45:30,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:30,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:45:30,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-17 22:45:30,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:30,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:30,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:30,966 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:30,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:30,966 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:30,966 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:30,966 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:30,966 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:30,966 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:30,966 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:30,966 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:45:30,966 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:30,966 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:30,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:30,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:31,001 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:31,001 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:31,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:31,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:31,003 INFO L229 MonitoredProcess]: Starting monitored process 33 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-02-17 22:45:31,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-17 22:45:31,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:31,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:31,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-17 22:45:31,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:31,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:31,033 INFO L229 MonitoredProcess]: Starting monitored process 34 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-02-17 22:45:31,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-17 22:45:31,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:31,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:31,123 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:31,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-17 22:45:31,128 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:31,128 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:31,128 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:31,128 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:31,128 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:31,128 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:31,128 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:31,128 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:31,128 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2-buggy.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:45:31,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:31,128 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:31,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:31,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:31,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:31,157 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:31,157 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:31,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:31,159 INFO L229 MonitoredProcess]: Starting monitored process 35 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-02-17 22:45:31,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-17 22:45:31,161 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-02-17 22:45:31,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:31,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:31,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:31,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:31,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:31,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:31,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:31,173 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:31,174 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:31,174 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:31,177 INFO L229 MonitoredProcess]: Starting monitored process 36 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-02-17 22:45:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-17 22:45:31,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:31,179 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:31,179 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:31,179 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:45:31,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-17 22:45:31,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:31,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:45:31,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:45:31,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:31,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:31,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:31,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:31,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:31,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:31,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:31,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:31,244 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-02-17 22:45:31,245 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 199 transitions. cyclomatic complexity: 90 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:31,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 199 transitions. cyclomatic complexity: 90. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 277 states and 456 transitions. Complement of second has 7 states. [2025-02-17 22:45:31,273 INFO L141 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-02-17 22:45:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-02-17 22:45:31,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 5 letters. [2025-02-17 22:45:31,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:31,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 19 letters. Loop has 5 letters. [2025-02-17 22:45:31,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:31,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 10 letters. [2025-02-17 22:45:31,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:31,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 277 states and 456 transitions. [2025-02-17 22:45:31,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-17 22:45:31,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 277 states to 250 states and 404 transitions. [2025-02-17 22:45:31,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2025-02-17 22:45:31,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2025-02-17 22:45:31,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 250 states and 404 transitions. [2025-02-17 22:45:31,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:31,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 250 states and 404 transitions. [2025-02-17 22:45:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states and 404 transitions. [2025-02-17 22:45:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2025-02-17 22:45:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.7096774193548387) internal successors, (318), 185 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 318 transitions. [2025-02-17 22:45:31,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 318 transitions. [2025-02-17 22:45:31,293 INFO L432 stractBuchiCegarLoop]: Abstraction has 186 states and 318 transitions. [2025-02-17 22:45:31,293 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:45:31,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 318 transitions. [2025-02-17 22:45:31,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-17 22:45:31,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:31,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:31,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-17 22:45:31,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-17 22:45:31,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:31,296 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L13-->L38: 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]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:31,296 INFO L754 eck$LassoCheckResult]: Loop: "[59] L40-1-->L46: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[60] L46-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[49] 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[]" "[61] L47-->L38: Formula: (= v_l_4 1) InVars {} OutVars{l=v_l_4} AuxVars[] AssignedVars[l]" "[51] 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]" "[52] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[53] L30-->L31: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[56] L38-->L40: Formula: (< v_x2_6 v_z_4) InVars {x2=v_x2_6, z=v_z_4} OutVars{x2=v_x2_6, z=v_z_4} AuxVars[] AssignedVars[]" "[54] L31-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[58] L40-->L40-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" [2025-02-17 22:45:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 772118264, now seen corresponding path program 1 times [2025-02-17 22:45:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333325262] [2025-02-17 22:45:31,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:31,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:31,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:31,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:31,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:31,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:31,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:31,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:31,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2026790102, now seen corresponding path program 1 times [2025-02-17 22:45:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44113720] [2025-02-17 22:45:31,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:31,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:31,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:31,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:31,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:31,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:31,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:31,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1308158733, now seen corresponding path program 3 times [2025-02-17 22:45:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180447725] [2025-02-17 22:45:31,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:31,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-02-17 22:45:31,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-17 22:45:31,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-17 22:45:31,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-17 22:45:31,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-17 22:45:31,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:31,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:31,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:31,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:31,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:31,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:31,488 INFO L201 PluginConnector]: Adding new model clock2-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:31 BoogieIcfgContainer [2025-02-17 22:45:31,488 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:31,489 INFO L158 Benchmark]: Toolchain (without parser) took 3992.18ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.8MB in the beginning and 100.5MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:31,489 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:31,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.91ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:31,489 INFO L158 Benchmark]: Boogie Preprocessor took 12.82ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 84.0MB in the end (delta: 545.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:31,489 INFO L158 Benchmark]: RCFGBuilder took 173.12ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:31,489 INFO L158 Benchmark]: BuchiAutomizer took 3783.63ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.7MB in the beginning and 100.5MB in the end (delta: -25.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:31,490 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.84ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.91ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 12.82ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 84.0MB in the end (delta: 545.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 173.12ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3783.63ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.7MB in the beginning and 100.5MB in the end (delta: -25.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 6 deterministic, 0 nondeterministic) and one nonterminating remainder module.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 -1 * x1 + z and consists of 4 locations. 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. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 186 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 200 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 83 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax100 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 40]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L13] FORK 0 fork 1 thread1(); [L14] FORK 0 fork 2, 2 thread2(); [L38] COND TRUE 2 x2 < z VAL [x2=-2, z=0] [L42] 2 assume l > 0; [L43] 2 l := 0; VAL [l=0, x2=-2, z=0] [L45] 2 x2 := x2 + 1; VAL [l=0, x2=-1, z=0] [L46] 2 x1 := x1 - 1; VAL [l=0, x1=0, x2=-1, z=0] [L47] 2 l := 1; VAL [l=1, x1=0, x2=-1, z=0] [L38] COND TRUE 2 x2 < z VAL [l=1, x1=0, x2=-1, z=0] [L42] 2 assume l > 0; [L43] 2 l := 0; VAL [l=0, x1=0, x2=-1, z=0] Loop: [L45] x2 := x2 + 1; [L46] x1 := x1 - 1; [L22] COND TRUE x1 < z [L47] l := 1; [L26] assume l > 0; [L27] l := 0; [L29] x1 := x1 + 1; [L30] x2 := x2 - 1; [L38] COND TRUE x2 < z [L31] l := 1; [L42] assume l > 0; [L43] l := 0; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 40]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] FORK 0 fork 1 thread1(); [L14] FORK 0 fork 2, 2 thread2(); [L38] COND TRUE 2 x2 < z VAL [x2=-2, z=0] [L42] 2 assume l > 0; [L43] 2 l := 0; VAL [l=0, x2=-2, z=0] [L45] 2 x2 := x2 + 1; VAL [l=0, x2=-1, z=0] [L46] 2 x1 := x1 - 1; VAL [l=0, x1=0, x2=-1, z=0] [L47] 2 l := 1; VAL [l=1, x1=0, x2=-1, z=0] [L38] COND TRUE 2 x2 < z VAL [l=1, x1=0, x2=-1, z=0] [L42] 2 assume l > 0; [L43] 2 l := 0; VAL [l=0, x1=0, x2=-1, z=0] Loop: [L45] x2 := x2 + 1; [L46] x1 := x1 - 1; [L22] COND TRUE x1 < z [L47] l := 1; [L26] assume l > 0; [L27] l := 0; [L29] x1 := x1 + 1; [L30] x2 := x2 - 1; [L38] COND TRUE x2 < z [L31] l := 1; [L42] assume l > 0; [L43] l := 0; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-17 22:45:31,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...