/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-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:13,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:13,076 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,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:13,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:13,080 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,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:13,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:13,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:13,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:13,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:13,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:13,103 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:13,103 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:13,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:13,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:13,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:13,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:13,105 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:13,106 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:13,106 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:13,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:13,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:13,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:13,332 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:13,333 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:13,334 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-symm.wvr.bpl [2025-04-26 16:54:13,334 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl' [2025-04-26 16:54:13,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:13,355 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:13,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:13,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:13,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:13,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,391 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:13,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:13,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:13,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:13,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:13,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:13,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:13,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:13,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:13,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:13,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,438 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,441 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,462 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:13,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:13,462 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:13,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:13,463 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:13,463 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,500 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:13,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:13,571 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:13,571 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:13,578 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:13,578 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:13,579 INFO L201 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:13 BoogieIcfgContainer [2025-04-26 16:54:13,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:13,582 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:13,582 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:13,585 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:13,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:13,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/2) ... [2025-04-26 16:54:13,587 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eb29d1e and model type array-eq-symm.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,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:13,587 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:13" (2/2) ... [2025-04-26 16:54:13,588 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-eq-symm.wvr.bpl [2025-04-26 16:54:13,625 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:13,666 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:13,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:13,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,669 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:13,671 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:13,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 27 transitions, 68 flow [2025-04-26 16:54:13,744 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-26 16:54:13,745 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 4/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 17. Up to 3 conditions per place. [2025-04-26 16:54:13,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 27 transitions, 68 flow [2025-04-26 16:54:13,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 58 flow [2025-04-26 16:54:13,750 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 23 transitions, 58 flow [2025-04-26 16:54:13,755 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:13,801 WARN L140 AmpleReduction]: Number of pruned transitions: 28 [2025-04-26 16:54:13,801 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:13,801 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13 [2025-04-26 16:54:13,801 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 16:54:13,801 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:22 [2025-04-26 16:54:13,801 WARN L145 AmpleReduction]: Times succ was already a loop node:7 [2025-04-26 16:54:13,801 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:20 [2025-04-26 16:54:13,802 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:13,803 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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:13,808 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:13,808 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:13,808 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:13,808 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:13,808 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:13,808 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:13,808 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:13,808 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:13,810 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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:13,818 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2025-04-26 16:54:13,819 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:13,819 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:13,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:13,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:13,821 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:13,822 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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:13,824 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2025-04-26 16:54:13,824 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:13,824 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:13,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:13,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:13,828 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:54:13,828 INFO L754 eck$LassoCheckResult]: Loop: "[61] L22-2-->L22: 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[]" "[63] L22-->L23: 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[]" "[65] L23-->L22-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:13,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2525, now seen corresponding path program 1 times [2025-04-26 16:54:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220778837] [2025-04-26 16:54:13,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:13,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:13,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:13,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:13,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash 90430, now seen corresponding path program 1 times [2025-04-26 16:54:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093658177] [2025-04-26 16:54:13,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash 75282914, now seen corresponding path program 1 times [2025-04-26 16:54:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334857846] [2025-04-26 16:54:13,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:13,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:13,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,034 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:14,035 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:14,035 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:14,035 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:14,035 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:14,035 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,035 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:14,035 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:14,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:14,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:14,035 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:14,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,138 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:14,141 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:14,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,144 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,146 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,147 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,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,198 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,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,200 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,201 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,202 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,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,218 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:14,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,225 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,227 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,228 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,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,244 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,252 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,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,256 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:14,257 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:14,258 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,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:54:14,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,283 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:14,285 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:14,286 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,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,305 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:14,315 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:54:14,315 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,318 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:14,320 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:14,321 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:14,340 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:14,341 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:14,341 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:14,341 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AB, An) = -1*i_AB + 1*An Supporting invariants [] [2025-04-26 16:54:14,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:14,350 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:14,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:14,397 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,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,408 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,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,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:14,462 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:14,464 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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:14,565 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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 179 states and 308 transitions. Complement of second has 7 states. [2025-04-26 16:54:14,567 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:14,571 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:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-26 16:54:14,578 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:54:14,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:54:14,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:54:14,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 308 transitions. [2025-04-26 16:54:14,590 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 45 [2025-04-26 16:54:14,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 104 states and 176 transitions. [2025-04-26 16:54:14,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-04-26 16:54:14,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-04-26 16:54:14,598 INFO L74 IsDeterministic]: Start isDeterministic. Operand 104 states and 176 transitions. [2025-04-26 16:54:14,598 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:14,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 176 transitions. [2025-04-26 16:54:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 176 transitions. [2025-04-26 16:54:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2025-04-26 16:54:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.7945205479452055) internal successors, (in total 131), 72 states have internal predecessors, (131), 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,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 131 transitions. [2025-04-26 16:54:14,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 131 transitions. [2025-04-26 16:54:14,620 INFO L438 stractBuchiCegarLoop]: Abstraction has 73 states and 131 transitions. [2025-04-26 16:54:14,620 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:14,620 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 131 transitions. [2025-04-26 16:54:14,623 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 33 [2025-04-26 16:54:14,624 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,624 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:14,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,624 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: 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:14,624 INFO L754 eck$LassoCheckResult]: Loop: "[64] L22-->L27: 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[]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[61] L22-2-->L22: 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:14,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 78336, now seen corresponding path program 1 times [2025-04-26 16:54:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575879654] [2025-04-26 16:54:14,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,634 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,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,639 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,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash 93402, now seen corresponding path program 1 times [2025-04-26 16:54:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235471725] [2025-04-26 16:54:14,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,650 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,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:14,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:14,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235471725] [2025-04-26 16:54:14,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235471725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:14,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:54:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891365948] [2025-04-26 16:54:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:14,673 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:54:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:14,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:54:14,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:54:14,675 INFO L87 Difference]: Start difference. First operand 73 states and 131 transitions. cyclomatic complexity: 69 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:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:14,689 INFO L93 Difference]: Finished difference Result 93 states and 146 transitions. [2025-04-26 16:54:14,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 146 transitions. [2025-04-26 16:54:14,690 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-04-26 16:54:14,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 65 states and 107 transitions. [2025-04-26 16:54:14,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-04-26 16:54:14,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-04-26 16:54:14,691 INFO L74 IsDeterministic]: Start isDeterministic. Operand 65 states and 107 transitions. [2025-04-26 16:54:14,691 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:14,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 107 transitions. [2025-04-26 16:54:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 107 transitions. [2025-04-26 16:54:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2025-04-26 16:54:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6862745098039216) internal successors, (in total 86), 50 states have internal predecessors, (86), 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,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2025-04-26 16:54:14,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 86 transitions. [2025-04-26 16:54:14,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:54:14,694 INFO L438 stractBuchiCegarLoop]: Abstraction has 51 states and 86 transitions. [2025-04-26 16:54:14,694 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:14,694 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 86 transitions. [2025-04-26 16:54:14,695 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:54:14,695 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,695 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:54:14,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,696 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] L22-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[]" "[62] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[79] L52-1-->L37-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:14,696 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" [2025-04-26 16:54:14,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 75281936, now seen corresponding path program 1 times [2025-04-26 16:54:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759440078] [2025-04-26 16:54:14,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:14,700 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,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:14,703 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,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 97413, now seen corresponding path program 1 times [2025-04-26 16:54:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770485541] [2025-04-26 16:54:14,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,708 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,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,709 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,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 751294486, now seen corresponding path program 1 times [2025-04-26 16:54:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372934908] [2025-04-26 16:54:14,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:14,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,762 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:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:14,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372934908] [2025-04-26 16:54:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372934908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:14,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475212553] [2025-04-26 16:54:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:14,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:14,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:14,790 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. cyclomatic complexity: 40 Second operand has 4 states, 4 states have (on average 2.0) 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:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:14,829 INFO L93 Difference]: Finished difference Result 60 states and 96 transitions. [2025-04-26 16:54:14,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 96 transitions. [2025-04-26 16:54:14,830 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:54:14,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 57 states and 93 transitions. [2025-04-26 16:54:14,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 16:54:14,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-04-26 16:54:14,830 INFO L74 IsDeterministic]: Start isDeterministic. Operand 57 states and 93 transitions. [2025-04-26 16:54:14,830 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:14,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 93 transitions. [2025-04-26 16:54:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 93 transitions. [2025-04-26 16:54:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-04-26 16:54:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6666666666666667) internal successors, (in total 85), 50 states have internal predecessors, (85), 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,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2025-04-26 16:54:14,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 85 transitions. [2025-04-26 16:54:14,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:14,833 INFO L438 stractBuchiCegarLoop]: Abstraction has 51 states and 85 transitions. [2025-04-26 16:54:14,833 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:14,833 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 85 transitions. [2025-04-26 16:54:14,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:54:14,834 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,834 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:14,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,835 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: 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[]" "[63] L22-->L23: 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[]" "[79] L52-1-->L37-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]" "[65] L23-->L22-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]" "[60] L22-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[]" [2025-04-26 16:54:14,835 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" [2025-04-26 16:54:14,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -667548149, now seen corresponding path program 1 times [2025-04-26 16:54:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147970709] [2025-04-26 16:54:14,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:14,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:14,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:14,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash 97413, now seen corresponding path program 2 times [2025-04-26 16:54:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943783326] [2025-04-26 16:54:14,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,858 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,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1228258757, now seen corresponding path program 1 times [2025-04-26 16:54:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142739673] [2025-04-26 16:54:14,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:14,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:14,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,941 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:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:14,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142739673] [2025-04-26 16:54:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142739673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:54:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830226953] [2025-04-26 16:54:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:14,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:14,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:14,967 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:15,030 INFO L93 Difference]: Finished difference Result 89 states and 141 transitions. [2025-04-26 16:54:15,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 141 transitions. [2025-04-26 16:54:15,031 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 21 [2025-04-26 16:54:15,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 141 transitions. [2025-04-26 16:54:15,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-04-26 16:54:15,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-04-26 16:54:15,037 INFO L74 IsDeterministic]: Start isDeterministic. Operand 89 states and 141 transitions. [2025-04-26 16:54:15,037 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 141 transitions. [2025-04-26 16:54:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 141 transitions. [2025-04-26 16:54:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2025-04-26 16:54:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6111111111111112) internal successors, (in total 116), 71 states have internal predecessors, (116), 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,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2025-04-26 16:54:15,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 116 transitions. [2025-04-26 16:54:15,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:15,041 INFO L438 stractBuchiCegarLoop]: Abstraction has 72 states and 116 transitions. [2025-04-26 16:54:15,041 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:15,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 116 transitions. [2025-04-26 16:54:15,041 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:54:15,042 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,042 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,042 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: 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[]" "[64] L22-->L27: 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[]" "[79] L52-1-->L37-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]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[60] L22-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[]" [2025-04-26 16:54:15,042 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[70] L37-->L38: Formula: (= (select v_B_3 v_i_BA_2) (select v_A_3 v_i_BA_2)) InVars {A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} OutVars{A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} AuxVars[] AssignedVars[]" "[72] L38-->L37-2: Formula: (= (+ v_i_BA_4 1) v_i_BA_3) InVars {i_BA=v_i_BA_4} OutVars{i_BA=v_i_BA_3} AuxVars[] AssignedVars[i_BA]" [2025-04-26 16:54:15,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -667518327, now seen corresponding path program 1 times [2025-04-26 16:54:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030170801] [2025-04-26 16:54:15,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash 97381, now seen corresponding path program 1 times [2025-04-26 16:54:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610052645] [2025-04-26 16:54:15,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,062 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,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,063 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,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash -339831587, now seen corresponding path program 1 times [2025-04-26 16:54:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977094621] [2025-04-26 16:54:15,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:15,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:15,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,149 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,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:15,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977094621] [2025-04-26 16:54:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977094621] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:54:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283395191] [2025-04-26 16:54:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:15,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:15,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:15,176 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. cyclomatic complexity: 51 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:15,220 INFO L93 Difference]: Finished difference Result 104 states and 160 transitions. [2025-04-26 16:54:15,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 160 transitions. [2025-04-26 16:54:15,221 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2025-04-26 16:54:15,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 160 transitions. [2025-04-26 16:54:15,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2025-04-26 16:54:15,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2025-04-26 16:54:15,225 INFO L74 IsDeterministic]: Start isDeterministic. Operand 104 states and 160 transitions. [2025-04-26 16:54:15,225 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 160 transitions. [2025-04-26 16:54:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 160 transitions. [2025-04-26 16:54:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2025-04-26 16:54:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5888888888888888) internal successors, (in total 143), 89 states have internal predecessors, (143), 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,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2025-04-26 16:54:15,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-04-26 16:54:15,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:15,231 INFO L438 stractBuchiCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-04-26 16:54:15,231 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:15,231 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 143 transitions. [2025-04-26 16:54:15,232 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:54:15,232 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,232 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,232 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: 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[]" "[64] L22-->L27: 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[]" "[79] L52-1-->L37-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]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[60] L22-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[]" [2025-04-26 16:54:15,232 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" [2025-04-26 16:54:15,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash -667518327, now seen corresponding path program 2 times [2025-04-26 16:54:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35486727] [2025-04-26 16:54:15,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:15,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,244 INFO L85 PathProgramCache]: Analyzing trace with hash 97413, now seen corresponding path program 3 times [2025-04-26 16:54:15,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972937235] [2025-04-26 16:54:15,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,249 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,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash -339831555, now seen corresponding path program 1 times [2025-04-26 16:54:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621175595] [2025-04-26 16:54:15,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:15,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:15,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:15,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,364 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,365 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,365 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:54:15,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,365 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,509 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,509 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,512 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,513 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,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,528 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,535 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,536 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,537 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,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,551 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:15,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,559 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,560 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,562 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,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,578 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,587 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,588 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,590 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,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,600 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:15,600 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:15,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,614 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:15,614 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:15,643 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,651 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,653 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,654 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,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:15,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,675 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,677 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,678 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,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:15,698 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:15,698 INFO L437 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:54:15,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,702 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,704 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,705 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:15,720 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,720 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:15,720 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:15,720 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_BA 1 0)_2) = -2*v_rep(ite break_BA 1 0)_2 + 1 Supporting invariants [] [2025-04-26 16:54:15,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:15,728 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:15,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,753 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,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,767 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,767 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,767 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 143 transitions. cyclomatic complexity: 64 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,788 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 143 transitions. cyclomatic complexity: 64. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 149 states and 236 transitions. Complement of second has 6 states. [2025-04-26 16:54:15,788 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:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-26 16:54:15,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:54:15,789 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:54:15,789 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 16:54:15,789 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 236 transitions. [2025-04-26 16:54:15,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:54:15,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 69 states and 102 transitions. [2025-04-26 16:54:15,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 16:54:15,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:54:15,791 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69 states and 102 transitions. [2025-04-26 16:54:15,791 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 102 transitions. [2025-04-26 16:54:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 102 transitions. [2025-04-26 16:54:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 40. [2025-04-26 16:54:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.5) internal successors, (in total 60), 39 states have internal predecessors, (60), 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,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2025-04-26 16:54:15,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-04-26 16:54:15,795 INFO L438 stractBuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-04-26 16:54:15,795 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:15,795 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 60 transitions. [2025-04-26 16:54:15,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:54:15,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,796 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: 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[]" "[63] L22-->L23: 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[]" "[79] L52-1-->L37-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]" "[65] L23-->L22-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]" "[60] L22-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[]" [2025-04-26 16:54:15,796 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[70] L37-->L38: Formula: (= (select v_B_3 v_i_BA_2) (select v_A_3 v_i_BA_2)) InVars {A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} OutVars{A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} AuxVars[] AssignedVars[]" "[72] L38-->L37-2: Formula: (= (+ v_i_BA_4 1) v_i_BA_3) InVars {i_BA=v_i_BA_4} OutVars{i_BA=v_i_BA_3} AuxVars[] AssignedVars[i_BA]" [2025-04-26 16:54:15,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -667548149, now seen corresponding path program 2 times [2025-04-26 16:54:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242153107] [2025-04-26 16:54:15,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:15,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:15,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:15,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 97381, now seen corresponding path program 2 times [2025-04-26 16:54:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442414314] [2025-04-26 16:54:15,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:15,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,818 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,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1228258789, now seen corresponding path program 1 times [2025-04-26 16:54:15,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008673245] [2025-04-26 16:54:15,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:15,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:15,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:15,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,939 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,939 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,939 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,939 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,939 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,939 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,939 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:15,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,939 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,078 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,078 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,080 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,082 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,083 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,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,097 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,103 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,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,105 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,106 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,108 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,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,124 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,130 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,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,132 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,133 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,135 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,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,156 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,165 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,167 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,169 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,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,180 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:16,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:54:16,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,206 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:54:16,207 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:16,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,209 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:16,209 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:16,210 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,227 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:16,227 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:16,227 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,227 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(An, i_BA) = 1*An - 1*i_BA Supporting invariants [] [2025-04-26 16:54:16,233 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,234 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:16,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:16,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,260 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,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,278 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,278 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,279 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 60 transitions. cyclomatic complexity: 25 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,302 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 60 transitions. cyclomatic complexity: 25. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 67 states and 100 transitions. Complement of second has 6 states. [2025-04-26 16:54:16,303 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,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 16:54:16,303 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:54:16,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:54:16,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 16:54:16,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 100 transitions. [2025-04-26 16:54:16,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:16,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2025-04-26 16:54:16,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:16,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:16,305 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:16,305 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:16,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,305 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,305 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:54:16,305 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:16,305 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:16,305 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:16,315 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:16,316 INFO L201 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:16 BoogieIcfgContainer [2025-04-26 16:54:16,316 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:16,317 INFO L158 Benchmark]: Toolchain (without parser) took 2961.16ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 56.1MB in the end (delta: 27.7MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:16,317 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 84.8MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.01ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,317 INFO L158 Benchmark]: Boogie Preprocessor took 20.92ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 81.1MB in the end (delta: 849.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,317 INFO L158 Benchmark]: RCFGBuilder took 165.97ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 71.7MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:16,317 INFO L158 Benchmark]: BuchiAutomizer took 2734.32ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 56.1MB in the end (delta: 15.6MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2025-04-26 16:54:16,318 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.23ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 84.8MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.01ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.92ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 81.1MB in the end (delta: 849.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 165.97ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 71.7MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2734.32ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 56.1MB in the end (delta: 15.6MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 111 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 96 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital54 mio100 ax100 hnf100 lsp66 ukn99 mio100 lsp71 div100 bol100 ite100 ukn100 eq166 hnf94 smp94 dnf129 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 139, Number of transitions in reduction automaton: 89, Number of states in reduction automaton: 55, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_AB + An and consists of 5 locations. One deterministic module has affine ranking function -2 * (if break_BA then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function An + -1 * i_BA and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:16,331 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...