/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/barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:09,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:09,776 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:09,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:09,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:09,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:09,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:09,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:09,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:09,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:09,810 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:09,810 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:09,810 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:09,810 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:09,810 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:09,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:09,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:09,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:09,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:09,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:09,812 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:09,812 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:10,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:10,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:10,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:10,049 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:10,050 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:10,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/barrier-2t.c.bpl [2025-04-26 16:24:10,053 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/barrier-2t.c.bpl' [2025-04-26 16:24:10,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:10,071 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:10,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:10,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:10,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:10,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,106 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:10,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:10,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:10,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:10,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:10,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:10,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:10,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:10,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:10,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/1) ... [2025-04-26 16:24:10,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,157 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:10,159 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:10,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:10,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:10,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:10,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:10,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:10,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:10,179 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:10,212 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:10,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:10,299 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:10,299 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:10,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:10,308 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:10,308 INFO L201 PluginConnector]: Adding new model barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:10 BoogieIcfgContainer [2025-04-26 16:24:10,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:10,311 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:10,311 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:10,315 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:10,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:10,316 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:10" (1/2) ... [2025-04-26 16:24:10,318 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6650d4ef and model type barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:10, skipping insertion in model container [2025-04-26 16:24:10,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:10,318 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:10" (2/2) ... [2025-04-26 16:24:10,319 INFO L376 chiAutomizerObserver]: Analyzing ICFG barrier-2t.c.bpl [2025-04-26 16:24:10,370 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:10,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-04-26 16:24:10,425 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-26 16:24:10,429 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:10,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:24:10,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-04-26 16:24:10,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 60 flow [2025-04-26 16:24:10,441 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 24 transitions, 60 flow [2025-04-26 16:24:10,453 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:10,453 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:10,454 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:10,454 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:10,454 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:10,454 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:10,454 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:10,454 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:10,455 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:10,497 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 56 [2025-04-26 16:24:10,498 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:10,498 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:10,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:10,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:10,501 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:10,501 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 83 states, but on-demand construction may add more states [2025-04-26 16:24:10,509 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 56 [2025-04-26 16:24:10,509 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:10,509 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:10,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:10,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:10,514 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:10,515 INFO L754 eck$LassoCheckResult]: Loop: "[63] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[65] L24-->L22: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:10,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2779, now seen corresponding path program 1 times [2025-04-26 16:24:10,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514792780] [2025-04-26 16:24:10,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 16:24:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709048125] [2025-04-26 16:24:10,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2672637, now seen corresponding path program 1 times [2025-04-26 16:24:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272765040] [2025-04-26 16:24:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:10,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:10,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:10,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:10,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,670 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,671 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,671 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,671 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,671 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:10,671 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,671 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,672 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,672 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:10,672 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,672 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,720 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,721 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,726 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:10,729 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:10,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:10,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,752 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:10,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,754 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:10,756 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:10,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:10,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,835 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:10,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:10,839 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,839 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,840 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,840 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:10,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,840 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:10,840 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,840 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,870 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,873 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,876 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:10,901 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:10,903 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:10,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:10,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:10,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:10,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:10,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:10,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:10,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:10,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:10,962 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:10,962 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,966 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:10,968 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:10,968 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:10,972 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:10,973 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:10,973 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:10,974 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:10,974 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:10,980 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:10,984 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:11,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,039 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,066 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:11,125 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:11,128 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 83 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,285 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 83 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 276 states and 628 transitions. Complement of second has 7 states. [2025-04-26 16:24:11,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-26 16:24:11,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:11,295 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:11,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:11,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 628 transitions. [2025-04-26 16:24:11,303 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 34 [2025-04-26 16:24:11,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 154 states and 361 transitions. [2025-04-26 16:24:11,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-04-26 16:24:11,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2025-04-26 16:24:11,309 INFO L74 IsDeterministic]: Start isDeterministic. Operand 154 states and 361 transitions. [2025-04-26 16:24:11,309 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:11,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 361 transitions. [2025-04-26 16:24:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 361 transitions. [2025-04-26 16:24:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2025-04-26 16:24:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 2.4140625) internal successors, (in total 309), 127 states have internal predecessors, (309), 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:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 309 transitions. [2025-04-26 16:24:11,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 309 transitions. [2025-04-26 16:24:11,331 INFO L438 stractBuchiCegarLoop]: Abstraction has 128 states and 309 transitions. [2025-04-26 16:24:11,331 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:11,331 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 309 transitions. [2025-04-26 16:24:11,333 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 34 [2025-04-26 16:24:11,333 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:11,333 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:11,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:11,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:11,333 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L13-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:11,333 INFO L754 eck$LassoCheckResult]: Loop: "[72] L37-->L39: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[74] L39-->L37: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:11,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 86234, now seen corresponding path program 1 times [2025-04-26 16:24:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116474750] [2025-04-26 16:24:11,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:11,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:11,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:11,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:11,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:24:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684657742] [2025-04-26 16:24:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 82873180, now seen corresponding path program 1 times [2025-04-26 16:24:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866897410] [2025-04-26 16:24:11,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:11,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:11,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,366 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:11,367 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:11,367 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:11,367 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:11,367 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:11,367 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,367 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:11,367 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:11,367 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:11,367 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:11,367 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:11,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:11,394 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:11,394 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:11,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,396 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:11,397 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:11,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:11,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:11,414 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:11,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,416 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:11,417 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:11,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:11,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:11,484 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:11,488 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:11,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:11,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:11,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:11,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:11,489 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:11,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:11,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:11,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:11,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:11,489 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:11,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:11,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:11,508 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:11,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,511 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:11,514 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:11,514 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:11,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:11,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:11,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:11,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:11,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:11,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:11,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:11,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:11,532 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:11,532 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,534 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:11,535 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:11,536 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:11,538 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:11,539 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:11,539 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:11,539 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:11,544 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:11,545 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:11,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:11,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:11,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,593 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:11,594 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:11,594 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 309 transitions. cyclomatic complexity: 214 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,684 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 309 transitions. cyclomatic complexity: 214. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 396 states and 943 transitions. Complement of second has 7 states. [2025-04-26 16:24:11,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-26 16:24:11,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:11,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:11,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:11,685 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 943 transitions. [2025-04-26 16:24:11,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:24:11,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 9 states and 11 transitions. [2025-04-26 16:24:11,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-04-26 16:24:11,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-04-26 16:24:11,694 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-04-26 16:24:11,694 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:11,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-04-26 16:24:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-04-26 16:24:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-04-26 16:24:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (in total 11), 8 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:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-04-26 16:24:11,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-04-26 16:24:11,695 INFO L438 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-04-26 16:24:11,695 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:11,695 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2025-04-26 16:24:11,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:24:11,695 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:11,695 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:11,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:11,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:11,696 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] L22-->L26: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L26-->L27: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[66] L27-->L28-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:11,696 INFO L754 eck$LassoCheckResult]: Loop: "[68] L28-1-->L30: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L30-->L28-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:11,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 82850821, now seen corresponding path program 1 times [2025-04-26 16:24:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253648386] [2025-04-26 16:24:11,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:11,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:11,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,733 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:11,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:11,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253648386] [2025-04-26 16:24:11,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253648386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:11,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522386966] [2025-04-26 16:24:11,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:11,737 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:11,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:24:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575287720] [2025-04-26 16:24:11,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,756 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:11,757 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:11,757 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:11,757 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:11,757 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:11,757 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,757 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:11,757 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:11,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:11,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:11,757 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:11,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:11,780 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:11,780 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,786 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:11,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:11,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:11,793 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:11,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:11,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,819 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:11,820 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:11,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:11,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:11,889 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:11,894 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:11,895 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:11,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:11,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:11,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:11,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:11,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:11,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:11,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:11,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:11,895 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:11,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:11,928 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:11,928 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:11,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,932 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:11,933 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:11,935 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:11,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:11,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:11,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:11,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:11,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:11,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:11,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:11,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:11,959 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:11,959 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:11,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,963 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:11,966 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:11,966 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:11,970 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:11,970 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:11,970 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:11,970 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:11,975 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:11,976 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:11,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:12,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:12,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:12,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:12,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:12,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:12,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:12,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:12,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:12,026 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:12,027 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:12,027 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:12,049 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 11 states and 14 transitions. Complement of second has 4 states. [2025-04-26 16:24:12,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-04-26 16:24:12,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:12,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:12,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:12,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:12,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:12,051 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:12,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2025-04-26 16:24:12,051 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:12,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2025-04-26 16:24:12,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:12,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:12,051 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:12,051 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:12,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:12,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:12,054 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:12,055 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:24:12,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:24:12,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:12,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:24:12,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:12,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:12,056 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:12,056 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:12,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:12,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:12,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:24:12,056 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:12,056 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:12,056 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:12,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:12,056 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:12,062 INFO L201 PluginConnector]: Adding new model barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:12 BoogieIcfgContainer [2025-04-26 16:24:12,062 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:12,062 INFO L158 Benchmark]: Toolchain (without parser) took 1991.73ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.0MB in the beginning and 52.5MB in the end (delta: 32.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2025-04-26 16:24:12,063 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.91ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:12,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.54ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:12,063 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 993.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:12,063 INFO L158 Benchmark]: RCFGBuilder took 180.56ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 73.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:12,063 INFO L158 Benchmark]: BuchiAutomizer took 1751.19ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 52.5MB in the end (delta: 20.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2025-04-26 16:24:12,064 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.91ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.54ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 993.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 180.56ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 73.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1751.19ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.9MB in the beginning and 52.5MB in the end (delta: 20.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 50 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 100ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:12,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...