/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:13,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:13,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:13,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:13,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:13,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:13,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:13,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:13,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:13,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:13,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:13,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:13,406 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:13,406 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:13,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:13,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:13,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:13,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:13,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:13,409 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:13,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:13,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:13,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:13,410 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:13,410 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:13,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:13,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:13,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:13,632 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:13,632 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:13,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl [2025-04-26 16:54:13,633 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl' [2025-04-26 16:54:13,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:13,654 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:13,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:13,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:13,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:13,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,694 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:13,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:13,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:13,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:13,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:13,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:13,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:13,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:13,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:13,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:13,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:13,778 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:13,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:13,778 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:13,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:13,778 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:13,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:13,779 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:54:13,814 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:13,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:13,913 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:13,913 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:13,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:13,922 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:13,922 INFO L201 PluginConnector]: Adding new model array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:13 BoogieIcfgContainer [2025-04-26 16:54:13,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:13,923 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:13,923 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:13,927 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:13,928 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:13,928 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/2) ... [2025-04-26 16:54:13,928 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7146efbd and model type array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:13, skipping insertion in model container [2025-04-26 16:54:13,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:13,929 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:13" (2/2) ... [2025-04-26 16:54:13,929 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-eq-trans.wvr.bpl [2025-04-26 16:54:13,978 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:54:14,022 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:14,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:14,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 97 flow [2025-04-26 16:54:14,103 INFO L116 PetriNetUnfolderBase]: 6/32 cut-off events. [2025-04-26 16:54:14,105 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:54:14,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 6/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-04-26 16:54:14,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 97 flow [2025-04-26 16:54:14,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 82 flow [2025-04-26 16:54:14,113 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 32 transitions, 82 flow [2025-04-26 16:54:14,119 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:14,318 WARN L140 AmpleReduction]: Number of pruned transitions: 388 [2025-04-26 16:54:14,318 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:14,318 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 96 [2025-04-26 16:54:14,318 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 16:54:14,318 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:184 [2025-04-26 16:54:14,318 WARN L145 AmpleReduction]: Times succ was already a loop node:55 [2025-04-26 16:54:14,318 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:213 [2025-04-26 16:54:14,319 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:14,321 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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:54:14,327 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:14,328 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:14,328 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:14,328 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:14,328 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:14,328 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:14,328 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:14,328 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:14,332 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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:54:14,349 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 280 [2025-04-26 16:54:14,350 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,350 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:14,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,353 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:14,354 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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:54:14,361 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 280 [2025-04-26 16:54:14,361 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,361 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:14,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,368 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:54:14,368 INFO L754 eck$LassoCheckResult]: Loop: "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[88] L26-->L27: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[90] L27-->L26-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" [2025-04-26 16:54:14,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 1 times [2025-04-26 16:54:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721734347] [2025-04-26 16:54:14,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:14,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:14,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:14,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash 115255, now seen corresponding path program 1 times [2025-04-26 16:54:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838201825] [2025-04-26 16:54:14,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 103966681, now seen corresponding path program 1 times [2025-04-26 16:54:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218255640] [2025-04-26 16:54:14,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:14,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:14,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:14,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:14,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,695 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:14,696 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:14,696 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:14,696 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:14,696 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:14,696 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:14,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:14,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:14,697 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:14,697 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:14,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,887 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:14,890 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:14,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,895 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:54:14,896 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:54:14,897 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:54:14,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,920 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:14,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,930 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:54:14,932 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:54:14,934 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:54:14,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,957 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:54:14,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,960 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:54:14,962 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:54:14,963 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:54:14,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,990 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,997 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:54:14,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,999 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:54:15,001 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:54:15,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,024 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,030 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:54:15,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,033 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:54:15,034 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:54:15,036 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:54:15,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:15,066 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:15,066 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,069 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:54:15,071 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:54:15,072 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:15,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:54:15,090 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:15,090 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:15,091 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AB, Bn) = -1*i_AB + 1*Bn Supporting invariants [] [2025-04-26 16:54:15,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,100 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:15,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:15,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:15,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,174 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:54:15,190 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:54:15,191 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 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:54:15,316 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 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 1033 states and 2248 transitions. Complement of second has 7 states. [2025-04-26 16:54:15,317 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:54:15,320 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:54:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-26 16:54:15,323 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:54:15,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:54:15,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,324 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:54:15,324 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1033 states and 2248 transitions. [2025-04-26 16:54:15,336 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 345 [2025-04-26 16:54:15,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1033 states to 688 states and 1451 transitions. [2025-04-26 16:54:15,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2025-04-26 16:54:15,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2025-04-26 16:54:15,355 INFO L74 IsDeterministic]: Start isDeterministic. Operand 688 states and 1451 transitions. [2025-04-26 16:54:15,356 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 688 states and 1451 transitions. [2025-04-26 16:54:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states and 1451 transitions. [2025-04-26 16:54:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 461. [2025-04-26 16:54:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 461 states have (on average 2.2364425162689803) internal successors, (in total 1031), 460 states have internal predecessors, (1031), 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:54:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1031 transitions. [2025-04-26 16:54:15,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 461 states and 1031 transitions. [2025-04-26 16:54:15,396 INFO L438 stractBuchiCegarLoop]: Abstraction has 461 states and 1031 transitions. [2025-04-26 16:54:15,396 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:15,396 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 461 states and 1031 transitions. [2025-04-26 16:54:15,398 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 237 [2025-04-26 16:54:15,398 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,398 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:15,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,399 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:54:15,399 INFO L754 eck$LassoCheckResult]: Loop: "[89] L26-->L31: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[91] L31-->L26-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:54:15,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 108183, now seen corresponding path program 1 times [2025-04-26 16:54:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661795835] [2025-04-26 16:54:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash 118227, now seen corresponding path program 1 times [2025-04-26 16:54:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482596119] [2025-04-26 16:54:15,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,432 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:54:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:15,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482596119] [2025-04-26 16:54:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482596119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:54:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507326112] [2025-04-26 16:54:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:15,437 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:54:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:15,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:54:15,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:54:15,439 INFO L87 Difference]: Start difference. First operand 461 states and 1031 transitions. cyclomatic complexity: 614 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 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:54:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:15,476 INFO L93 Difference]: Finished difference Result 607 states and 1212 transitions. [2025-04-26 16:54:15,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 1212 transitions. [2025-04-26 16:54:15,480 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 216 [2025-04-26 16:54:15,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 495 states and 1015 transitions. [2025-04-26 16:54:15,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 363 [2025-04-26 16:54:15,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 363 [2025-04-26 16:54:15,484 INFO L74 IsDeterministic]: Start isDeterministic. Operand 495 states and 1015 transitions. [2025-04-26 16:54:15,484 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 495 states and 1015 transitions. [2025-04-26 16:54:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 1015 transitions. [2025-04-26 16:54:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 381. [2025-04-26 16:54:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 381 states have (on average 2.0866141732283463) internal successors, (in total 795), 380 states have internal predecessors, (795), 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:54:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 795 transitions. [2025-04-26 16:54:15,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 381 states and 795 transitions. [2025-04-26 16:54:15,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:54:15,500 INFO L438 stractBuchiCegarLoop]: Abstraction has 381 states and 795 transitions. [2025-04-26 16:54:15,500 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:15,500 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 381 states and 795 transitions. [2025-04-26 16:54:15,502 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2025-04-26 16:54:15,502 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,502 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:54:15,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,503 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: 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:54:15,503 INFO L754 eck$LassoCheckResult]: Loop: "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" "[96] L41-->L46: Formula: (not (= (select v_B_4 v_i_BC_5) (select v_C_2 v_i_BC_5))) InVars {i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} OutVars{i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} AuxVars[] AssignedVars[]" "[98] L46-->L41-2: Formula: v_break_BC_2 InVars {} OutVars{break_BC=v_break_BC_2} AuxVars[] AssignedVars[break_BC]" [2025-04-26 16:54:15,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 103965710, now seen corresponding path program 1 times [2025-04-26 16:54:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071819933] [2025-04-26 16:54:15,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:15,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:15,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:15,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:15,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash 122238, now seen corresponding path program 1 times [2025-04-26 16:54:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692475335] [2025-04-26 16:54:15,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 571138641, now seen corresponding path program 1 times [2025-04-26 16:54:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863412358] [2025-04-26 16:54:15,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,692 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,693 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,693 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,693 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,693 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,693 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,693 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:15,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,693 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,812 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,812 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,815 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:54:15,816 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:54:15,817 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:54:15,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,832 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:15,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,840 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:54:15,840 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:54:15,842 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:54:15,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,855 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,864 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:54:15,874 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:54:15,875 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:54:15,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,889 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,896 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:54:15,897 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:54:15,898 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:54:15,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,913 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,918 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:54:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,920 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:54:15,922 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:54:15,923 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:54:15,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,937 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,945 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:54:15,947 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:54:15,948 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:54:15,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,958 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:15,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:54:15,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,961 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,967 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:54:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,970 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:54:15,971 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:54:15,971 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:54:15,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,981 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:15,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,984 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:54:15,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,991 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,997 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:54:15,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,999 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:54:16,000 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:54:16,001 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:54:16,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,016 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,018 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:16,018 INFO L437 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:54:16,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,020 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:54:16,021 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:54:16,022 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,039 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:16,039 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,039 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_BC 1 0)_2) = -2*v_rep(ite break_BC 1 0)_2 + 1 Supporting invariants [] [2025-04-26 16:54:16,045 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:54:16,046 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:16,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,090 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:54:16,090 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:54:16,091 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 381 states and 795 transitions. cyclomatic complexity: 441 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:54:16,132 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 381 states and 795 transitions. cyclomatic complexity: 441. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 1256 states and 2583 transitions. Complement of second has 6 states. [2025-04-26 16:54:16,133 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:54:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:54:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 16:54:16,134 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:54:16,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,134 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:54:16,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,134 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:54:16,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1256 states and 2583 transitions. [2025-04-26 16:54:16,146 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 116 [2025-04-26 16:54:16,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1256 states to 950 states and 1930 transitions. [2025-04-26 16:54:16,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 394 [2025-04-26 16:54:16,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2025-04-26 16:54:16,154 INFO L74 IsDeterministic]: Start isDeterministic. Operand 950 states and 1930 transitions. [2025-04-26 16:54:16,154 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:16,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 950 states and 1930 transitions. [2025-04-26 16:54:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1930 transitions. [2025-04-26 16:54:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 667. [2025-04-26 16:54:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 667 states have (on average 2.070464767616192) internal successors, (in total 1381), 666 states have internal predecessors, (1381), 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:54:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1381 transitions. [2025-04-26 16:54:16,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 667 states and 1381 transitions. [2025-04-26 16:54:16,171 INFO L438 stractBuchiCegarLoop]: Abstraction has 667 states and 1381 transitions. [2025-04-26 16:54:16,171 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:16,171 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 1381 transitions. [2025-04-26 16:54:16,176 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2025-04-26 16:54:16,176 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,176 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:16,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:16,177 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: 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]" "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" [2025-04-26 16:54:16,177 INFO L754 eck$LassoCheckResult]: Loop: "[95] L41-->L42: Formula: (= (select v_C_1 v_i_BC_2) (select v_B_3 v_i_BC_2)) InVars {i_BC=v_i_BC_2, C=v_C_1, B=v_B_3} OutVars{i_BC=v_i_BC_2, C=v_C_1, B=v_B_3} AuxVars[] AssignedVars[]" "[97] L42-->L41-2: Formula: (= (+ v_i_BC_4 1) v_i_BC_3) InVars {i_BC=v_i_BC_4} OutVars{i_BC=v_i_BC_3} AuxVars[] AssignedVars[i_BC]" "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" [2025-04-26 16:54:16,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1072030193, now seen corresponding path program 1 times [2025-04-26 16:54:16,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787421353] [2025-04-26 16:54:16,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:16,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:16,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:16,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:16,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash 124186, now seen corresponding path program 1 times [2025-04-26 16:54:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511586246] [2025-04-26 16:54:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 525427788, now seen corresponding path program 1 times [2025-04-26 16:54:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879939491] [2025-04-26 16:54:16,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,360 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,360 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,360 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,360 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,360 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:16,360 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,360 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,467 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,467 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,469 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:54:16,470 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:54:16,471 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:54:16,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,490 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,497 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:16,498 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,500 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:54:16,502 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:54:16,502 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,519 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:54:16,519 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:16,519 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,519 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(Bn, i_BC) = 1*Bn - 1*i_BC Supporting invariants [] [2025-04-26 16:54:16,525 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:54:16,526 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:16,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:16,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,576 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:54:16,576 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:54:16,576 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 1381 transitions. cyclomatic complexity: 756 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:54:16,670 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 1381 transitions. cyclomatic complexity: 756. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 2458 states and 5023 transitions. Complement of second has 6 states. [2025-04-26 16:54:16,670 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:54:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:54:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-26 16:54:16,671 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:54:16,672 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,672 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:54:16,672 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,672 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:54:16,672 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2458 states and 5023 transitions. [2025-04-26 16:54:16,693 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 84 [2025-04-26 16:54:16,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2458 states to 1522 states and 3103 transitions. [2025-04-26 16:54:16,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 533 [2025-04-26 16:54:16,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 557 [2025-04-26 16:54:16,704 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1522 states and 3103 transitions. [2025-04-26 16:54:16,704 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:16,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1522 states and 3103 transitions. [2025-04-26 16:54:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states and 3103 transitions. [2025-04-26 16:54:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1265. [2025-04-26 16:54:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1265 states have (on average 2.082213438735178) internal successors, (in total 2634), 1264 states have internal predecessors, (2634), 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:54:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2634 transitions. [2025-04-26 16:54:16,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1265 states and 2634 transitions. [2025-04-26 16:54:16,751 INFO L438 stractBuchiCegarLoop]: Abstraction has 1265 states and 2634 transitions. [2025-04-26 16:54:16,751 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:16,751 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1265 states and 2634 transitions. [2025-04-26 16:54:16,755 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:54:16,755 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,755 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:16,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:16,756 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: 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]" "[92] L41-2-->thread2FINAL: Formula: (or (<= v_Bn_4 v_i_BC_6) (<= v_Cn_2 v_i_BC_6) v_break_BC_3) InVars {i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} OutVars{i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} AuxVars[] AssignedVars[]" "[94] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L72-->L56-2: 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:54:16,756 INFO L754 eck$LassoCheckResult]: Loop: "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" "[102] L56-->L57: Formula: (= (select v_A_4 v_i_AC_5) (select v_C_4 v_i_AC_5)) InVars {A=v_A_4, i_AC=v_i_AC_5, C=v_C_4} OutVars{A=v_A_4, i_AC=v_i_AC_5, C=v_C_4} AuxVars[] AssignedVars[]" "[104] L57-->L56-2: Formula: (= v_i_AC_6 (+ v_i_AC_7 1)) InVars {i_AC=v_i_AC_7} OutVars{i_AC=v_i_AC_6} AuxVars[] AssignedVars[i_AC]" [2025-04-26 16:54:16,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash 571137634, now seen corresponding path program 1 times [2025-04-26 16:54:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726849730] [2025-04-26 16:54:16,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:16,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:16,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:16,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:16,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 129157, now seen corresponding path program 1 times [2025-04-26 16:54:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329311565] [2025-04-26 16:54:16,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1899072892, now seen corresponding path program 1 times [2025-04-26 16:54:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905510067] [2025-04-26 16:54:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:16,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:16,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:16,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,955 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,955 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,956 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,956 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,956 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:54:16,956 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,956 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,085 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:17,085 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:17,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,087 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:54:17,088 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:54:17,089 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:54:17,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,098 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:17,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,101 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:54:17,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:17,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:17,111 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:17,111 INFO L437 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:54:17,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,114 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:54:17,115 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:54:17,116 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:17,132 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:54:17,132 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:17,133 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:17,133 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AC, An) = -1*i_AC + 1*An Supporting invariants [] [2025-04-26 16:54:17,138 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:54:17,139 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:17,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:17,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:17,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,189 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:54:17,190 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:54:17,190 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1265 states and 2634 transitions. cyclomatic complexity: 1421 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:17,241 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1265 states and 2634 transitions. cyclomatic complexity: 1421. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3391 states and 7029 transitions. Complement of second has 6 states. [2025-04-26 16:54:17,242 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:54:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-26 16:54:17,244 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:54:17,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:54:17,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 16:54:17,245 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3391 states and 7029 transitions. [2025-04-26 16:54:17,263 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:54:17,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3391 states to 3135 states and 6504 transitions. [2025-04-26 16:54:17,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 696 [2025-04-26 16:54:17,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 715 [2025-04-26 16:54:17,300 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3135 states and 6504 transitions. [2025-04-26 16:54:17,300 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:17,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3135 states and 6504 transitions. [2025-04-26 16:54:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states and 6504 transitions. [2025-04-26 16:54:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2499. [2025-04-26 16:54:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2499 states have (on average 2.0776310524209682) internal successors, (in total 5192), 2498 states have internal predecessors, (5192), 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:54:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 5192 transitions. [2025-04-26 16:54:17,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2499 states and 5192 transitions. [2025-04-26 16:54:17,344 INFO L438 stractBuchiCegarLoop]: Abstraction has 2499 states and 5192 transitions. [2025-04-26 16:54:17,344 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:17,344 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2499 states and 5192 transitions. [2025-04-26 16:54:17,352 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:54:17,352 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:17,352 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:17,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:17,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:17,353 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: 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]" "[92] L41-2-->thread2FINAL: Formula: (or (<= v_Bn_4 v_i_BC_6) (<= v_Cn_2 v_i_BC_6) v_break_BC_3) InVars {i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} OutVars{i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} AuxVars[] AssignedVars[]" "[94] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L72-->L56-2: 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]" "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" [2025-04-26 16:54:17,353 INFO L754 eck$LassoCheckResult]: Loop: "[103] L56-->L61: Formula: (not (= (select v_A_5 v_i_AC_8) (select v_C_5 v_i_AC_8))) InVars {A=v_A_5, i_AC=v_i_AC_8, C=v_C_5} OutVars{A=v_A_5, i_AC=v_i_AC_8, C=v_C_5} AuxVars[] AssignedVars[]" "[105] L61-->L56-2: Formula: v_break_AC_2 InVars {} OutVars{break_AC=v_break_AC_2} AuxVars[] AssignedVars[break_AC]" "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" [2025-04-26 16:54:17,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,353 INFO L85 PathProgramCache]: Analyzing trace with hash 525397570, now seen corresponding path program 1 times [2025-04-26 16:54:17,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991344279] [2025-04-26 16:54:17,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:17,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:17,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:17,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 132129, now seen corresponding path program 1 times [2025-04-26 16:54:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715952734] [2025-04-26 16:54:17,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:17,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:17,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,385 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:54:17,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:17,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715952734] [2025-04-26 16:54:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715952734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:54:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602311833] [2025-04-26 16:54:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:17,386 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:54:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:17,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:54:17,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:54:17,386 INFO L87 Difference]: Start difference. First operand 2499 states and 5192 transitions. cyclomatic complexity: 2788 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 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:54:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:17,417 INFO L93 Difference]: Finished difference Result 3046 states and 6136 transitions. [2025-04-26 16:54:17,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3046 states and 6136 transitions. [2025-04-26 16:54:17,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:17,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3046 states to 0 states and 0 transitions. [2025-04-26 16:54:17,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:17,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:17,434 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:17,434 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:17,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:17,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:17,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:54:17,435 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:17,435 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:17,435 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:17,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:17,435 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:17,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:17,447 INFO L201 PluginConnector]: Adding new model array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:17 BoogieIcfgContainer [2025-04-26 16:54:17,447 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:17,448 INFO L158 Benchmark]: Toolchain (without parser) took 3793.90ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.9MB in the beginning and 62.0MB in the end (delta: 23.9MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2025-04-26 16:54:17,448 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:17,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.22ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:17,449 INFO L158 Benchmark]: Boogie Preprocessor took 29.40ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 82.6MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:17,449 INFO L158 Benchmark]: RCFGBuilder took 196.32ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.4MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:17,449 INFO L158 Benchmark]: BuchiAutomizer took 3524.33ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.4MB in the beginning and 62.0MB in the end (delta: 10.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:17,450 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.22ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.40ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 82.6MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 196.32ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.4MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3524.33ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 72.4MB in the beginning and 62.0MB in the end (delta: 10.4MB). 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.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1517 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 221 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp56 ukn87 mio100 lsp88 div100 bol100 ite100 ukn100 eq134 hnf95 smp100 dnf108 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 301, Number of transitions in reduction automaton: 641, Number of states in reduction automaton: 307, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_AB + Bn and consists of 5 locations. One deterministic module has affine ranking function -2 * (if break_BC then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function Bn + -1 * i_BC and consists of 4 locations. One deterministic module has affine ranking function -1 * i_AC + An and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:17,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...