/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.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:16,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:16,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:16,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:16,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:16,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:16,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:16,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:16,817 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:16,817 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:16,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:16,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:16,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:16,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:16,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:16,819 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:16,819 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:17,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:17,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:17,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:17,050 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:17,051 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:17,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/clock2.c.bpl [2025-04-26 16:24:17,053 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/clock2.c.bpl' [2025-04-26 16:24:17,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:17,068 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:17,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:17,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:17,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:17,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,104 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:17,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:17,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:17,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:17,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:17,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:17,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:17,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:17,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:17,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/1) ... [2025-04-26 16:24:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:17,158 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-04-26 16:24:17,160 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-04-26 16:24:17,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:17,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:17,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:17,182 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:17,220 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:17,222 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:17,297 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:17,297 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:17,314 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:17,314 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:17,314 INFO L201 PluginConnector]: Adding new model clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:17 BoogieIcfgContainer [2025-04-26 16:24:17,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:17,317 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:17,317 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:17,321 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:17,321 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:17,322 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:17" (1/2) ... [2025-04-26 16:24:17,322 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f6be013 and model type clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:17, skipping insertion in model container [2025-04-26 16:24:17,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:17,323 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:17" (2/2) ... [2025-04-26 16:24:17,323 INFO L376 chiAutomizerObserver]: Analyzing ICFG clock2.c.bpl [2025-04-26 16:24:17,371 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:17,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 24 transitions, 62 flow [2025-04-26 16:24:17,415 INFO L116 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-04-26 16:24:17,417 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:17,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 3/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:24:17,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 24 transitions, 62 flow [2025-04-26 16:24:17,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 52 flow [2025-04-26 16:24:17,424 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 24 places, 20 transitions, 52 flow [2025-04-26 16:24:17,432 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:17,433 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:17,433 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:17,433 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:17,433 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:17,433 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:17,433 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:17,433 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:17,435 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:17,466 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-04-26 16:24:17,467 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:17,467 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:17,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:17,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:17,470 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:17,470 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 64 states, but on-demand construction may add more states [2025-04-26 16:24:17,473 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2025-04-26 16:24:17,473 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:17,474 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:17,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:17,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:17,478 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:17,478 INFO L754 eck$LassoCheckResult]: Loop: "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[60] L30-->L30-2: Formula: (<= v_x2_3 v_x1_6) InVars {x1=v_x1_6, x2=v_x2_3} OutVars{x1=v_x1_6, x2=v_x2_3} AuxVars[] AssignedVars[]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 16:24:17,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2025-04-26 16:24:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:17,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529760998] [2025-04-26 16:24:17,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:17,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:17,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:17,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:17,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:17,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:17,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:17,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:17,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:17,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash 81178553, now seen corresponding path program 1 times [2025-04-26 16:24:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:17,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906394694] [2025-04-26 16:24:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:17,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:17,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:17,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:17,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:17,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:17,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:17,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:17,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:17,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:17,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:17,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1322244492, now seen corresponding path program 1 times [2025-04-26 16:24:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:17,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439900802] [2025-04-26 16:24:17,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:17,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:17,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:17,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:17,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:17,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:17,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:17,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:17,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:17,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:17,698 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:17,698 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:17,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:17,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:17,699 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:17,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:17,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:17,700 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:17,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:17,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:17,700 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:17,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:17,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:17,776 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:17,777 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:17,780 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-04-26 16:24:17,782 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-04-26 16:24:17,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:17,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:17,805 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:17,806 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:17,812 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-04-26 16:24:17,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:17,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:17,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:17,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:17,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:17,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:17,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:17,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:17,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:17,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:17,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:17,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:17,951 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:17,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:17,957 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:17,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:17,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:17,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:17,957 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:17,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:17,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:17,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:17,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:17,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:17,957 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:17,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:17,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:17,998 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:18,001 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:18,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:18,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:18,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:18,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:18,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:18,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:18,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:18,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:18,041 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:18,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:18,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:18,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:18,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:18,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:18,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:18,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:18,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:18,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:18,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:18,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:18,067 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:18,067 INFO L437 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:18,090 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:18,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:18,093 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:18,093 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:18,094 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:18,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:24:18,105 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:18,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:18,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:18,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:18,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:18,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:18,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:18,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:18,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:18,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:18,297 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:18,301 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 64 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:18,420 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 64 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 157 states and 354 transitions. Complement of second has 6 states. [2025-04-26 16:24:18,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-26 16:24:18,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 1 letters. Loop has 5 letters. [2025-04-26 16:24:18,434 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:18,435 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 16:24:18,435 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:18,435 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 1 letters. Loop has 10 letters. [2025-04-26 16:24:18,435 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:18,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 354 transitions. [2025-04-26 16:24:18,442 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:24:18,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 95 states and 220 transitions. [2025-04-26 16:24:18,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 16:24:18,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-04-26 16:24:18,453 INFO L74 IsDeterministic]: Start isDeterministic. Operand 95 states and 220 transitions. [2025-04-26 16:24:18,453 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:18,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 220 transitions. [2025-04-26 16:24:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 220 transitions. [2025-04-26 16:24:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2025-04-26 16:24:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.3164556962025316) internal successors, (in total 183), 78 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 183 transitions. [2025-04-26 16:24:18,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 183 transitions. [2025-04-26 16:24:18,473 INFO L438 stractBuchiCegarLoop]: Abstraction has 79 states and 183 transitions. [2025-04-26 16:24:18,474 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:18,474 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 183 transitions. [2025-04-26 16:24:18,476 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:24:18,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:18,476 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:18,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:18,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:18,477 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:18,477 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:24:18,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 3236, now seen corresponding path program 1 times [2025-04-26 16:24:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:18,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604264440] [2025-04-26 16:24:18,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:18,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:18,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:18,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:18,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:18,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:18,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:18,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 1 times [2025-04-26 16:24:18,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:18,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327394567] [2025-04-26 16:24:18,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:18,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:18,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:18,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:18,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:18,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:18,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1304481145, now seen corresponding path program 1 times [2025-04-26 16:24:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:18,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385560676] [2025-04-26 16:24:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:18,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:18,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:18,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:18,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:18,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:18,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:18,547 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:18,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:18,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:18,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:18,548 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:18,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:18,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:18,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:18,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:18,548 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:18,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:18,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:18,591 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:18,591 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:18,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:18,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:18,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:18,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:24:18,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:18,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:18,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:18,690 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:18,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:18,694 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:18,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:18,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:18,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:18,694 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:18,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,694 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:18,694 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:18,694 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:18,694 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:18,694 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:18,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:18,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:18,732 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:18,732 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:18,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:18,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:18,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:18,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:18,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:18,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:18,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:18,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:18,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:18,753 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:18,753 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:18,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:18,755 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:18,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:18,757 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:18,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:18,760 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:18,760 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:18,760 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:24:18,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:24:18,768 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:18,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:18,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:18,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:18,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:18,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:18,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:18,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:18,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:18,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:18,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:18,838 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:18,838 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 183 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:18,910 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 183 transitions. cyclomatic complexity: 115. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 271 states and 641 transitions. Complement of second has 7 states. [2025-04-26 16:24:18,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:24:18,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:18,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:18,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:24:18,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:18,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:24:18,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:18,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 641 transitions. [2025-04-26 16:24:18,917 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:24:18,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 172 states and 407 transitions. [2025-04-26 16:24:18,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-04-26 16:24:18,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-04-26 16:24:18,919 INFO L74 IsDeterministic]: Start isDeterministic. Operand 172 states and 407 transitions. [2025-04-26 16:24:18,919 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:18,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 172 states and 407 transitions. [2025-04-26 16:24:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 407 transitions. [2025-04-26 16:24:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2025-04-26 16:24:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 2.381818181818182) internal successors, (in total 393), 164 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 393 transitions. [2025-04-26 16:24:18,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 393 transitions. [2025-04-26 16:24:18,927 INFO L438 stractBuchiCegarLoop]: Abstraction has 165 states and 393 transitions. [2025-04-26 16:24:18,927 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:18,927 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 393 transitions. [2025-04-26 16:24:18,930 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:24:18,930 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:18,930 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:18,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:18,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:18,930 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:18,930 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:24:18,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1960568410, now seen corresponding path program 1 times [2025-04-26 16:24:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:18,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644970580] [2025-04-26 16:24:18,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:18,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:18,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:18,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:18,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:18,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:18,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:18,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 2 times [2025-04-26 16:24:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:18,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551300440] [2025-04-26 16:24:18,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:18,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:18,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:18,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:18,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:18,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:18,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:18,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1032536381, now seen corresponding path program 1 times [2025-04-26 16:24:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:18,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233487951] [2025-04-26 16:24:18,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:18,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:18,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:18,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:18,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:19,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233487951] [2025-04-26 16:24:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233487951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338656241] [2025-04-26 16:24:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:19,047 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:19,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:19,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:19,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:19,047 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:19,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:19,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:19,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:19,048 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:19,048 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:19,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:19,088 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,094 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:19,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:19,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:19,116 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:19,116 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {l=1} Honda state: {l=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:19,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:24:19,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,124 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:19,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:19,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:19,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,145 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:19,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:19,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:19,212 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:19,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:19,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:19,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:19,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:19,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:19,216 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:19,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:19,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:19,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:19,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:19,216 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:19,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,257 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:19,257 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:19,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:19,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:19,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:19,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:19,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:19,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:19,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:19,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:19,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:19,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:24:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,282 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:19,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:19,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:19,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:19,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:19,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:19,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:19,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:19,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:19,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:19,303 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:19,303 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:19,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,304 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:24:19,306 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:19,308 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:19,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:19,309 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:19,310 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:19,310 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:19,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:24:19,316 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:19,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:19,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:19,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:19,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:19,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:19,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:19,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:19,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:19,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:19,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:19,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:19,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:19,397 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:19,397 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 393 transitions. cyclomatic complexity: 247 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,477 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 393 transitions. cyclomatic complexity: 247. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 712 states and 1682 transitions. Complement of second has 7 states. [2025-04-26 16:24:19,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:24:19,481 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:24:19,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:19,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:24:19,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:19,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:24:19,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:19,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 712 states and 1682 transitions. [2025-04-26 16:24:19,489 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:24:19,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 712 states to 484 states and 1135 transitions. [2025-04-26 16:24:19,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-04-26 16:24:19,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2025-04-26 16:24:19,494 INFO L74 IsDeterministic]: Start isDeterministic. Operand 484 states and 1135 transitions. [2025-04-26 16:24:19,494 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:19,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 484 states and 1135 transitions. [2025-04-26 16:24:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states and 1135 transitions. [2025-04-26 16:24:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 286. [2025-04-26 16:24:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 286 states have (on average 2.3776223776223775) internal successors, (in total 680), 285 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 680 transitions. [2025-04-26 16:24:19,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 286 states and 680 transitions. [2025-04-26 16:24:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:19,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:19,523 INFO L87 Difference]: Start difference. First operand 286 states and 680 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:19,546 INFO L93 Difference]: Finished difference Result 188 states and 374 transitions. [2025-04-26 16:24:19,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 374 transitions. [2025-04-26 16:24:19,548 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 16:24:19,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 167 states and 334 transitions. [2025-04-26 16:24:19,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-04-26 16:24:19,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-04-26 16:24:19,550 INFO L74 IsDeterministic]: Start isDeterministic. Operand 167 states and 334 transitions. [2025-04-26 16:24:19,550 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:19,550 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 334 transitions. [2025-04-26 16:24:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 334 transitions. [2025-04-26 16:24:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2025-04-26 16:24:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 153 states have (on average 2.0392156862745097) internal successors, (in total 312), 152 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 312 transitions. [2025-04-26 16:24:19,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 312 transitions. [2025-04-26 16:24:19,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:19,557 INFO L438 stractBuchiCegarLoop]: Abstraction has 153 states and 312 transitions. [2025-04-26 16:24:19,557 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:19,557 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 312 transitions. [2025-04-26 16:24:19,558 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 16:24:19,558 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:19,558 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:19,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1] [2025-04-26 16:24:19,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:19,559 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[74] L13-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[57] L24-->L24-1: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[58] L24-1-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[59] L30-->L32: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[61] L32-->L30-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[62] L30-2-->L22: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 16:24:19,559 INFO L754 eck$LassoCheckResult]: Loop: "[64] L41-->L43: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[66] L43-->L43-1: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[67] L43-1-->L49: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[68] L49-->L41: Formula: (= v_l_6 1) InVars {} OutVars{l=v_l_6} AuxVars[] AssignedVars[l]" [2025-04-26 16:24:19,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1931117224, now seen corresponding path program 1 times [2025-04-26 16:24:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:19,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963780893] [2025-04-26 16:24:19,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:24:19,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:24:19,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:19,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:19,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963780893] [2025-04-26 16:24:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963780893] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:24:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460896862] [2025-04-26 16:24:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:19,599 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:19,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2895716, now seen corresponding path program 3 times [2025-04-26 16:24:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:19,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710366165] [2025-04-26 16:24:19,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:24:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:19,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:19,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:19,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:24:19,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:19,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:19,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:19,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:19,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:19,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:19,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:19,631 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:19,631 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:19,631 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:19,631 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:19,631 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:19,631 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,631 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:19,631 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:19,631 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:19,631 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:19,631 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:19,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,664 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:19,664 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:19,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,666 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:24:19,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:19,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:19,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:24:19,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,686 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:24:19,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:19,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:19,757 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:19,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:19,761 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:19,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:19,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:19,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:19,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:19,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:19,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:19,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: clock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:19,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:19,762 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:19,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:19,788 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:19,788 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:19,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,790 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:24:19,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:19,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:19,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:19,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:19,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:19,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:19,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:19,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:19,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:19,815 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:19,815 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:19,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:19,817 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:19,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:24:19,819 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:19,822 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:19,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:19,823 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:19,823 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:19,823 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:19,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:24:19,829 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:19,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:19,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:24:19,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:24:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:19,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:19,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:19,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:19,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:19,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:19,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:19,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:19,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:19,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-04-26 16:24:19,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-04-26 16:24:19,940 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 312 transitions. cyclomatic complexity: 177 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,992 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 312 transitions. cyclomatic complexity: 177. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 435 states and 849 transitions. Complement of second has 7 states. [2025-04-26 16:24:19,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:24:19,993 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:24:19,993 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:19,994 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:20,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:20,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:24:20,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:24:20,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:20,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:20,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:20,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:20,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:20,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:20,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:20,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:20,056 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:20,056 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 312 transitions. cyclomatic complexity: 177 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:20,108 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 312 transitions. cyclomatic complexity: 177. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 451 states and 865 transitions. Complement of second has 9 states. [2025-04-26 16:24:20,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-26 16:24:20,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:24:20,110 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:20,110 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:20,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:20,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:24:20,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:24:20,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:20,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:20,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:20,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:20,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:20,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:20,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:20,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:20,182 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:20,183 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 312 transitions. cyclomatic complexity: 177 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:20,256 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 312 transitions. cyclomatic complexity: 177. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 653 states and 1251 transitions. Complement of second has 17 states. [2025-04-26 16:24:20,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:24:20,257 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:24:20,258 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:20,258 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:24:20,258 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:20,258 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:24:20,258 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:20,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 653 states and 1251 transitions. [2025-04-26 16:24:20,269 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:20,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 653 states to 0 states and 0 transitions. [2025-04-26 16:24:20,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:20,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:20,269 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:20,270 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:20,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:20,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:20,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:20,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:20,270 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:20,270 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:24:20,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:24:20,270 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:20,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:24:20,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:20,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:20,271 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:20,271 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:20,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:20,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:20,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:24:20,273 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:20,273 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:20,273 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:20,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:20,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:20,278 INFO L201 PluginConnector]: Adding new model clock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:20 BoogieIcfgContainer [2025-04-26 16:24:20,278 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:20,278 INFO L158 Benchmark]: Toolchain (without parser) took 3210.34ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.3MB in the beginning and 75.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:20,278 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:20,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 85.4MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:20,279 INFO L158 Benchmark]: Boogie Preprocessor took 19.08ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:20,279 INFO L158 Benchmark]: RCFGBuilder took 188.21ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 75.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:20,279 INFO L158 Benchmark]: BuchiAutomizer took 2960.72ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.1MB in the beginning and 75.0MB in the end (delta: 147.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:20,280 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.68ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 85.4MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.08ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 188.21ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 75.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2960.72ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.1MB in the beginning and 75.0MB in the end (delta: 147.6kB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 235 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 112 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp67 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One nondeterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:20,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...