/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/3_thr/barrier-3t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:30,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:30,593 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:30,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:30,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:30,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:30,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:30,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:30,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:30,618 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:30,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:30,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:30,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:30,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:30,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:30,619 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:30,620 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:30,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:30,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:30,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:30,832 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:30,832 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:30,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/barrier-3t.c.bpl [2025-04-26 16:24:30,833 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/barrier-3t.c.bpl' [2025-04-26 16:24:30,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:30,849 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:30,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:30,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:30,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:30,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,882 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:30,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:30,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:30,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:30,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:30,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:30,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:30,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:30,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:30,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:30,938 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:30,944 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:30,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:30,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:30,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:30,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:30,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:30,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:30,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:30,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:30,966 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:31,001 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:31,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:31,076 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:31,076 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:31,084 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:31,084 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:31,084 INFO L201 PluginConnector]: Adding new model barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:31 BoogieIcfgContainer [2025-04-26 16:24:31,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:31,085 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:31,085 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:31,089 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:31,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:31,090 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/2) ... [2025-04-26 16:24:31,091 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d6cc899 and model type barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:31, skipping insertion in model container [2025-04-26 16:24:31,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:31,091 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:31" (2/2) ... [2025-04-26 16:24:31,092 INFO L376 chiAutomizerObserver]: Analyzing ICFG barrier-3t.c.bpl [2025-04-26 16:24:31,151 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:31,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:24:31,206 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-26 16:24:31,208 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:31,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:24:31,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:24:31,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-04-26 16:24:31,222 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 35 transitions, 88 flow [2025-04-26 16:24:31,230 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:31,230 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:31,230 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:31,230 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:31,230 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:31,230 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:31,230 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:31,230 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:31,232 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:31,383 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 552 [2025-04-26 16:24:31,383 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:31,383 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:31,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:31,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:31,386 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:31,386 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 659 states, but on-demand construction may add more states [2025-04-26 16:24:31,396 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 552 [2025-04-26 16:24:31,397 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:31,397 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:31,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:31,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:31,401 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:31,401 INFO L754 eck$LassoCheckResult]: Loop: "[92] L24-->L26: 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[]" "[94] L26-->L24: 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:31,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 3685, now seen corresponding path program 1 times [2025-04-26 16:24:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290939539] [2025-04-26 16:24:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:31,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:31,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:24:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15923036] [2025-04-26 16:24:31,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:31,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:31,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:31,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:31,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 3544231, now seen corresponding path program 1 times [2025-04-26 16:24:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294547000] [2025-04-26 16:24:31,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:31,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:31,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:31,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:31,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,565 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:31,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:31,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:31,566 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:31,566 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:31,566 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,566 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:31,566 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:31,566 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:31,566 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:31,566 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:31,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:31,615 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:31,616 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:31,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,620 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:31,621 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:31,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:31,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:31,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:31,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,649 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:31,651 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:31,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:31,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:31,728 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:31,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:31,733 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:31,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:31,733 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:31,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:31,734 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:31,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,734 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:31,734 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:31,734 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:31,734 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:31,734 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:31,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:31,762 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:31,765 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,768 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:31,770 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:31,771 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:31,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:31,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:31,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:31,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:31,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:31,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:31,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:31,795 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:31,801 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:31,801 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:31,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,804 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:31,806 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:31,807 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:31,811 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:31,811 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:31,812 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:31,813 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:31,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:31,820 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:31,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:31,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:31,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:31,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:31,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:31,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:31,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:31,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:31,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:31,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:31,892 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:31,943 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:31,953 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 659 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:32,204 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 659 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 2290 states and 7961 transitions. Complement of second has 7 states. [2025-04-26 16:24:32,206 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:32,211 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:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-04-26 16:24:32,220 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 123 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:32,221 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,221 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 123 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:32,221 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,221 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 123 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:32,221 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2290 states and 7961 transitions. [2025-04-26 16:24:32,256 INFO L131 ngComponentsAnalysis]: Automaton has 212 accepting balls. 504 [2025-04-26 16:24:32,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2290 states to 1752 states and 6182 transitions. [2025-04-26 16:24:32,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 682 [2025-04-26 16:24:32,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1044 [2025-04-26 16:24:32,293 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1752 states and 6182 transitions. [2025-04-26 16:24:32,293 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:32,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1752 states and 6182 transitions. [2025-04-26 16:24:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states and 6182 transitions. [2025-04-26 16:24:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1392. [2025-04-26 16:24:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1392 states have (on average 3.630028735632184) internal successors, (in total 5053), 1391 states have internal predecessors, (5053), 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:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 5053 transitions. [2025-04-26 16:24:32,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1392 states and 5053 transitions. [2025-04-26 16:24:32,389 INFO L438 stractBuchiCegarLoop]: Abstraction has 1392 states and 5053 transitions. [2025-04-26 16:24:32,389 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:32,389 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1392 states and 5053 transitions. [2025-04-26 16:24:32,400 INFO L131 ngComponentsAnalysis]: Automaton has 212 accepting balls. 504 [2025-04-26 16:24:32,401 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:32,401 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:32,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:32,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:32,402 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:32,402 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L41: 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[]" "[103] L41-->L39: 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:32,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 114358, now seen corresponding path program 1 times [2025-04-26 16:24:32,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:32,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7509900] [2025-04-26 16:24:32,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:32,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:32,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:32,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:24:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:32,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117022722] [2025-04-26 16:24:32,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:32,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:32,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:32,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:32,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:32,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:32,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:32,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 109901272, now seen corresponding path program 1 times [2025-04-26 16:24:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:32,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636552518] [2025-04-26 16:24:32,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:32,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:32,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:32,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:32,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:32,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:32,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:32,452 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:32,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:32,452 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:32,452 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:32,452 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:32,452 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,452 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:32,452 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:32,452 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:32,452 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:32,452 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:32,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,476 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:32,477 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:32,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,480 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:32,482 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:32,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:32,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:32,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:32,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,503 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:32,504 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:32,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:32,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:32,570 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:32,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:32,574 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:32,574 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:32,574 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:32,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:32,575 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:32,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,575 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:32,575 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:32,575 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:32,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:32,575 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:32,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,594 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:32,595 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:32,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,597 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:32,598 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:32,599 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:32,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:32,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:32,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:32,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:32,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:32,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:32,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:32,615 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:32,617 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:32,617 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:32,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,619 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:32,621 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:32,622 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:32,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:32,625 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:32,625 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:32,625 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:24:32,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:32,633 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:32,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:32,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:32,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:32,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:32,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:32,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:32,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:32,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:32,676 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:32,677 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:32,677 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1392 states and 5053 transitions. cyclomatic complexity: 4043 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:32,829 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1392 states and 5053 transitions. cyclomatic complexity: 4043. 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 4969 states and 18187 transitions. Complement of second has 7 states. [2025-04-26 16:24:32,830 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:32,830 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:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-04-26 16:24:32,830 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 125 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:32,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 125 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:32,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 125 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:32,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4969 states and 18187 transitions. [2025-04-26 16:24:32,877 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 332 [2025-04-26 16:24:32,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4969 states to 3137 states and 11599 transitions. [2025-04-26 16:24:32,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 903 [2025-04-26 16:24:32,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1245 [2025-04-26 16:24:32,910 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3137 states and 11599 transitions. [2025-04-26 16:24:32,910 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:32,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3137 states and 11599 transitions. [2025-04-26 16:24:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states and 11599 transitions. [2025-04-26 16:24:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2799. [2025-04-26 16:24:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2799 states have (on average 3.7927831368345837) internal successors, (in total 10616), 2798 states have internal predecessors, (10616), 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:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 10616 transitions. [2025-04-26 16:24:32,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2799 states and 10616 transitions. [2025-04-26 16:24:32,972 INFO L438 stractBuchiCegarLoop]: Abstraction has 2799 states and 10616 transitions. [2025-04-26 16:24:32,972 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:32,972 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2799 states and 10616 transitions. [2025-04-26 16:24:32,999 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 332 [2025-04-26 16:24:32,999 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:32,999 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:33,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:33,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:33,001 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[126] L14-->L54: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:24:33,001 INFO L754 eck$LassoCheckResult]: Loop: "[110] L54-->L56: Formula: (< v_x4_5 v_z_9) InVars {x4=v_x4_5, z=v_z_9} OutVars{x4=v_x4_5, z=v_z_9} AuxVars[] AssignedVars[]" "[112] L56-->L54: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:33,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 3545224, now seen corresponding path program 1 times [2025-04-26 16:24:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812813942] [2025-04-26 16:24:33,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:24:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42881174] [2025-04-26 16:24:33,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -888003510, now seen corresponding path program 1 times [2025-04-26 16:24:33,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138754442] [2025-04-26 16:24:33,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:33,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,046 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,046 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,046 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:33,046 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,046 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,046 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,046 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:33,046 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,046 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,063 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,064 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:33,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,066 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:33,068 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:33,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:33,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,085 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:33,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,087 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:33,088 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:33,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:33,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,156 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:33,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,160 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,160 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:33,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:33,160 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,160 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,189 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,189 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:33,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,191 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:33,193 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:33,194 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:33,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:33,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:33,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:33,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:33,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:33,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:33,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:33,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:33,215 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:33,215 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,217 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:33,219 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:33,219 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:33,223 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:33,224 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:33,226 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:33,226 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:33,226 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:24:33,232 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:33,234 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:33,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,267 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,281 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:33,281 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:33,282 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2799 states and 10616 transitions. cyclomatic complexity: 8398 Second operand has 3 states, 3 states have (on average 2.0) 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:33,426 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2799 states and 10616 transitions. cyclomatic complexity: 8398. Second operand has 3 states, 3 states have (on average 2.0) 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 9329 states and 35100 transitions. Complement of second has 7 states. [2025-04-26 16:24:33,426 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:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) 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:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-26 16:24:33,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:33,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:24:33,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:24:33,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9329 states and 35100 transitions. [2025-04-26 16:24:33,539 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:24:33,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9329 states to 164 states and 417 transitions. [2025-04-26 16:24:33,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2025-04-26 16:24:33,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2025-04-26 16:24:33,541 INFO L74 IsDeterministic]: Start isDeterministic. Operand 164 states and 417 transitions. [2025-04-26 16:24:33,541 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:33,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 417 transitions. [2025-04-26 16:24:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 417 transitions. [2025-04-26 16:24:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-04-26 16:24:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 2.542682926829268) internal successors, (in total 417), 163 states have internal predecessors, (417), 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:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 417 transitions. [2025-04-26 16:24:33,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 417 transitions. [2025-04-26 16:24:33,543 INFO L438 stractBuchiCegarLoop]: Abstraction has 164 states and 417 transitions. [2025-04-26 16:24:33,543 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:33,543 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 417 transitions. [2025-04-26 16:24:33,544 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:24:33,544 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:33,544 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:33,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:33,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:33,545 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L24-->L28: 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[]" "[93] L28-->L29: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L29-->L30-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:33,545 INFO L754 eck$LassoCheckResult]: Loop: "[97] L30-1-->L32: 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[]" "[99] L32-->L30-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:33,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 109870264, now seen corresponding path program 1 times [2025-04-26 16:24:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577760698] [2025-04-26 16:24:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:33,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:33,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,597 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:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:33,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577760698] [2025-04-26 16:24:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577760698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:33,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083704015] [2025-04-26 16:24:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:33,603 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:33,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:24:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642419879] [2025-04-26 16:24:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,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:33,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,627 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,627 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,627 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,627 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,627 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:33,627 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,627 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,627 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,627 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:33,627 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,628 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,643 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,643 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:33,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,645 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:33,647 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:33,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:33,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,664 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:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,667 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:33,669 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:33,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:33,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,738 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:33,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,743 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,743 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,743 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,743 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,743 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:33,743 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,743 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,743 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,743 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:33,743 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,743 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,759 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,760 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,762 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:33,763 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:33,768 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:33,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:33,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:33,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:33,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:33,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:33,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:33,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:33,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:33,787 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:33,787 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:33,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,790 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:33,791 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:33,792 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:33,795 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:33,796 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:33,796 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:33,796 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:24:33,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,803 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:33,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,847 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:33,848 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:33,848 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 417 transitions. cyclomatic complexity: 286 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:33,884 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 417 transitions. cyclomatic complexity: 286. 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 355 states and 943 transitions. Complement of second has 7 states. [2025-04-26 16:24:33,885 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:33,885 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:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-26 16:24:33,885 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:33,885 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,885 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:33,885 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,885 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:33,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 943 transitions. [2025-04-26 16:24:33,887 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 18 [2025-04-26 16:24:33,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 234 states and 585 transitions. [2025-04-26 16:24:33,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-04-26 16:24:33,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-04-26 16:24:33,889 INFO L74 IsDeterministic]: Start isDeterministic. Operand 234 states and 585 transitions. [2025-04-26 16:24:33,889 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:33,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 234 states and 585 transitions. [2025-04-26 16:24:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 585 transitions. [2025-04-26 16:24:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 165. [2025-04-26 16:24:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 2.521212121212121) internal successors, (in total 416), 164 states have internal predecessors, (416), 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:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 416 transitions. [2025-04-26 16:24:33,892 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 416 transitions. [2025-04-26 16:24:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:33,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:33,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:33,895 INFO L87 Difference]: Start difference. First operand 165 states and 416 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:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:33,926 INFO L93 Difference]: Finished difference Result 95 states and 224 transitions. [2025-04-26 16:24:33,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 224 transitions. [2025-04-26 16:24:33,927 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:24:33,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 85 states and 198 transitions. [2025-04-26 16:24:33,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 16:24:33,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-04-26 16:24:33,928 INFO L74 IsDeterministic]: Start isDeterministic. Operand 85 states and 198 transitions. [2025-04-26 16:24:33,928 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:33,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 198 transitions. [2025-04-26 16:24:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 198 transitions. [2025-04-26 16:24:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-26 16:24:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 2.3294117647058825) internal successors, (in total 198), 84 states have internal predecessors, (198), 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:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2025-04-26 16:24:33,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 198 transitions. [2025-04-26 16:24:33,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:24:33,932 INFO L438 stractBuchiCegarLoop]: Abstraction has 85 states and 198 transitions. [2025-04-26 16:24:33,932 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:33,933 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 198 transitions. [2025-04-26 16:24:33,933 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:24:33,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:33,933 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:33,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:33,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:33,934 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L39-->L43: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[102] L43-->L44: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L24-->L28: 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[]" "[93] L28-->L29: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[104] L44-->L45-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:24:33,934 INFO L754 eck$LassoCheckResult]: Loop: "[106] L45-1-->L47: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[108] L47-->L45-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:33,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1302851726, now seen corresponding path program 1 times [2025-04-26 16:24:33,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673223565] [2025-04-26 16:24:33,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:33,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:33,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,983 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:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:33,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673223565] [2025-04-26 16:24:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673223565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97806882] [2025-04-26 16:24:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:33,983 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:33,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-04-26 16:24:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911831745] [2025-04-26 16:24:33,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,006 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,006 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:34,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,006 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,006 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:24:34,006 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,006 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,021 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,022 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:34,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,024 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:34,025 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:34,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,044 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:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,046 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:34,047 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:34,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:34,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,112 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:34,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:24:34,117 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,117 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,117 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,117 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,117 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:34,117 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,117 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,117 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,117 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:24:34,117 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,117 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,135 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,136 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,138 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:34,138 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:34,139 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:34,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:34,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:34,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:34,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:34,155 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:34,155 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:34,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,157 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:34,159 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:34,160 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:34,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:24:34,163 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:34,163 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:34,163 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:24:34,170 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:34,171 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:34,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:34,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,203 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,219 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:34,220 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:34,220 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 198 transitions. cyclomatic complexity: 131 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:34,243 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 198 transitions. cyclomatic complexity: 131. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 124 states and 284 transitions. Complement of second has 6 states. [2025-04-26 16:24:34,244 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:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 16:24:34,244 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:24:34,244 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,244 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:24:34,244 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:24:34,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 284 transitions. [2025-04-26 16:24:34,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:34,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 0 states and 0 transitions. [2025-04-26 16:24:34,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:34,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:34,246 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:34,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:34,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:24:34,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:24:34,246 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:34,246 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:34,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:34,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:34,246 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:34,246 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:34,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:34,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:34,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:24:34,247 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:34,247 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:24:34,247 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:34,247 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:34,247 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:34,253 INFO L201 PluginConnector]: Adding new model barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:34 BoogieIcfgContainer [2025-04-26 16:24:34,254 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:34,254 INFO L158 Benchmark]: Toolchain (without parser) took 3404.97ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 83.0MB in the beginning and 129.8MB in the end (delta: -46.9MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. [2025-04-26 16:24:34,255 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:34,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.65ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:34,256 INFO L158 Benchmark]: Boogie Preprocessor took 28.11ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 79.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:34,257 INFO L158 Benchmark]: RCFGBuilder took 170.37ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 70.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:34,257 INFO L158 Benchmark]: BuchiAutomizer took 3168.53ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 70.5MB in the beginning and 129.8MB in the end (delta: -59.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:34,258 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.14ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.65ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.11ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 79.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 170.37ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 70.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3168.53ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 70.5MB in the beginning and 129.8MB in the end (delta: -59.3MB). 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 3.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 767 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 166 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 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: 46ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 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 * x4 + 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 * x4 + z and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 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:34,271 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...