/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/popl20-more/inc-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:08,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:08,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:08,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:08,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:08,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:08,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:08,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:08,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:08,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:08,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:08,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:08,224 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:08,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:08,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:08,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:08,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:08,225 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:08,225 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:08,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:08,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:08,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:08,480 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:08,481 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:08,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl [2025-04-26 18:41:08,482 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl' [2025-04-26 18:41:08,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:08,500 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:08,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:08,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:08,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:08,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,537 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:08,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:08,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:08,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:08,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:08,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:08,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:08,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:08,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:08,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:08,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:08,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,590 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 18:41:08,595 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 18:41:08,611 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:08,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:08,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:08,612 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:08,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:08,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:08,612 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:08,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:08,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:08,613 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 18:41:08,653 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:08,655 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:08,749 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:08,749 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:08,764 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:08,764 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:08,765 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:08 BoogieIcfgContainer [2025-04-26 18:41:08,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:08,767 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:08,767 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:08,771 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:08,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:08,772 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/2) ... [2025-04-26 18:41:08,773 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d45c1f0 and model type inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:08, skipping insertion in model container [2025-04-26 18:41:08,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:08,773 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:08" (2/2) ... [2025-04-26 18:41:08,774 INFO L376 chiAutomizerObserver]: Analyzing ICFG inc-subseq-array.wvr.bpl [2025-04-26 18:41:08,819 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:08,855 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:08,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:08,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,858 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 18:41:08,859 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 18:41:08,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 18:41:08,930 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:41:08,932 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:08,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 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/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 18:41:08,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 18:41:08,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2025-04-26 18:41:08,941 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 26 transitions, 64 flow [2025-04-26 18:41:08,942 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 26 transitions, 64 flow [2025-04-26 18:41:08,956 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 65 states, 63 states have (on average 2.015873015873016) internal successors, (in total 127), 64 states have internal predecessors, (127), 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 18:41:08,958 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 65 states, 63 states have (on average 2.015873015873016) internal successors, (in total 127), 64 states have internal predecessors, (127), 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 18:41:08,960 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:09,048 WARN L140 AmpleReduction]: Number of pruned transitions: 29 [2025-04-26 18:41:09,048 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:09,048 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:41:09,048 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:29 [2025-04-26 18:41:09,048 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:26 [2025-04-26 18:41:09,048 WARN L145 AmpleReduction]: Times succ was already a loop node:8 [2025-04-26 18:41:09,048 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 18:41:09,048 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:09,049 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 18:41:09,054 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:09,054 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:09,054 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:09,054 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:09,054 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:09,054 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:09,054 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:09,054 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:09,056 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 18:41:09,065 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 41 [2025-04-26 18:41:09,065 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,065 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:09,068 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:09,068 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 18:41:09,074 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 41 [2025-04-26 18:41:09,074 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,074 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:09,078 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 18:41:09,078 INFO L754 eck$LassoCheckResult]: Loop: "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L24-->L24-2: Formula: (< (select v_A_4 v_i_5) v_last_3) InVars {A=v_A_4, last=v_last_3, i=v_i_5} OutVars{A=v_A_4, last=v_last_3, i=v_i_5} AuxVars[] AssignedVars[]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:09,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,085 INFO L85 PathProgramCache]: Analyzing trace with hash 88116564, now seen corresponding path program 1 times [2025-04-26 18:41:09,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793740899] [2025-04-26 18:41:09,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash 98406, now seen corresponding path program 1 times [2025-04-26 18:41:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003071115] [2025-04-26 18:41:09,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:09,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:09,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash 855608883, now seen corresponding path program 1 times [2025-04-26 18:41:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023963082] [2025-04-26 18:41:09,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:09,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:09,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:09,348 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 18:41:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:09,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023963082] [2025-04-26 18:41:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023963082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:09,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830737549] [2025-04-26 18:41:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:09,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:09,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:09,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:09,431 INFO L87 Difference]: Start difference. First operand has 59 states, 57 states have (on average 1.4385964912280702) internal successors, (in total 82), 58 states have internal predecessors, (82), 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 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:09,559 INFO L93 Difference]: Finished difference Result 150 states and 211 transitions. [2025-04-26 18:41:09,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 211 transitions. [2025-04-26 18:41:09,566 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 97 [2025-04-26 18:41:09,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 126 states and 178 transitions. [2025-04-26 18:41:09,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2025-04-26 18:41:09,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-04-26 18:41:09,578 INFO L74 IsDeterministic]: Start isDeterministic. Operand 126 states and 178 transitions. [2025-04-26 18:41:09,581 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:09,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 178 transitions. [2025-04-26 18:41:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 178 transitions. [2025-04-26 18:41:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 50. [2025-04-26 18:41:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.4) internal successors, (in total 70), 49 states have internal predecessors, (70), 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 18:41:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-04-26 18:41:09,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-04-26 18:41:09,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:09,611 INFO L438 stractBuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-04-26 18:41:09,611 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:09,612 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2025-04-26 18:41:09,612 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 41 [2025-04-26 18:41:09,613 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,613 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:09,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,614 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:09,614 INFO L754 eck$LassoCheckResult]: Loop: "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:09,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1219325706, now seen corresponding path program 1 times [2025-04-26 18:41:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130783276] [2025-04-26 18:41:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:09,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:09,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 98353833, now seen corresponding path program 1 times [2025-04-26 18:41:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680806580] [2025-04-26 18:41:09,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1840743124, now seen corresponding path program 1 times [2025-04-26 18:41:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793755278] [2025-04-26 18:41:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:09,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:09,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:09,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:09,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,779 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:09,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:09,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:09,780 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:09,780 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:09,780 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,780 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:09,780 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:09,780 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:09,780 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:09,780 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:09,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,919 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:09,921 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,925 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 18:41:09,927 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 18:41:09,929 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 18:41:09,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:09,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:09,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:09,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:09,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:09,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:09,953 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:09,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,963 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 18:41:09,964 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 18:41:09,966 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 18:41:09,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:09,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:09,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:09,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:09,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:09,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:09,985 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:09,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,993 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 18:41:09,995 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 18:41:09,997 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 18:41:10,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,021 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,031 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 18:41:10,032 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 18:41:10,032 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 18:41:10,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:10,064 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:10,064 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,085 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 18:41:10,087 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 18:41:10,087 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:10,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:10,104 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:10,104 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:10,104 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:10,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:10,111 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:10,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:10,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:10,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:10,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:10,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:10,200 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 18:41:10,202 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:41:10,203 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 70 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (in total 12), 5 states have internal predecessors, (12), 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 18:41:10,280 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 70 transitions. cyclomatic complexity: 27. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (in total 12), 5 states have internal predecessors, (12), 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 111 states and 163 transitions. Complement of second has 6 states. [2025-04-26 18:41:10,280 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 18:41:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (in total 12), 5 states have internal predecessors, (12), 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 18:41:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-26 18:41:10,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 7 letters. Loop has 5 letters. [2025-04-26 18:41:10,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,285 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 12 letters. Loop has 5 letters. [2025-04-26 18:41:10,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,285 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 7 letters. Loop has 10 letters. [2025-04-26 18:41:10,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 163 transitions. [2025-04-26 18:41:10,290 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:10,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 73 states and 106 transitions. [2025-04-26 18:41:10,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2025-04-26 18:41:10,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:41:10,291 INFO L74 IsDeterministic]: Start isDeterministic. Operand 73 states and 106 transitions. [2025-04-26 18:41:10,291 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:10,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 106 transitions. [2025-04-26 18:41:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 106 transitions. [2025-04-26 18:41:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2025-04-26 18:41:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.4736842105263157) internal successors, (in total 84), 56 states have internal predecessors, (84), 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 18:41:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-04-26 18:41:10,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-04-26 18:41:10,297 INFO L438 stractBuchiCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-04-26 18:41:10,297 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:10,297 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 84 transitions. [2025-04-26 18:41:10,298 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:10,298 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,298 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:10,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:10,299 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[68] L23-->thread1FINAL: Formula: (<= v_N_2 v_i_8) InVars {i=v_i_8, N=v_N_2} OutVars{i=v_i_8, N=v_N_2} AuxVars[] AssignedVars[]" "[70] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:10,299 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 18:41:10,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash 855607870, now seen corresponding path program 1 times [2025-04-26 18:41:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439383518] [2025-04-26 18:41:10,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:10,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:10,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:10,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:10,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 18:41:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914639507] [2025-04-26 18:41:10,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash 934833761, now seen corresponding path program 1 times [2025-04-26 18:41:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218652380] [2025-04-26 18:41:10,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:10,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:10,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,386 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 18:41:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:10,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218652380] [2025-04-26 18:41:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218652380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:10,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698057293] [2025-04-26 18:41:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:10,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:10,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:10,489 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:41:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:10,511 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2025-04-26 18:41:10,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 92 transitions. [2025-04-26 18:41:10,512 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:10,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 89 transitions. [2025-04-26 18:41:10,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 18:41:10,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:41:10,512 INFO L74 IsDeterministic]: Start isDeterministic. Operand 61 states and 89 transitions. [2025-04-26 18:41:10,513 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:10,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-04-26 18:41:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 89 transitions. [2025-04-26 18:41:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-04-26 18:41:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.459016393442623) internal successors, (in total 89), 60 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 18:41:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2025-04-26 18:41:10,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-04-26 18:41:10,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:10,519 INFO L438 stractBuchiCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-04-26 18:41:10,519 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:10,519 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 89 transitions. [2025-04-26 18:41:10,520 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:10,520 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,520 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:10,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:10,520 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 18:41:10,521 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 18:41:10,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1901365184, now seen corresponding path program 1 times [2025-04-26 18:41:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270668165] [2025-04-26 18:41:10,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:10,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:10,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:10,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:10,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 2 times [2025-04-26 18:41:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630621714] [2025-04-26 18:41:10,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:10,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:10,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:10,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash 544135907, now seen corresponding path program 1 times [2025-04-26 18:41:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234239622] [2025-04-26 18:41:10,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:10,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:10,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:10,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:10,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,751 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:10,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:10,752 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:10,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:10,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:10,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:10,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:10,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:10,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:10,752 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:10,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,987 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:10,987 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:10,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,989 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 18:41:10,990 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 18:41:10,992 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 18:41:11,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,006 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,011 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 18:41:11,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,014 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 18:41:11,014 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 18:41:11,015 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 18:41:11,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,029 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,037 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 18:41:11,038 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 18:41:11,039 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 18:41:11,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:11,064 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:11,064 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:11,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,066 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 18:41:11,067 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 18:41:11,068 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:11,086 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 18:41:11,087 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:11,087 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:11,087 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 18:41:11,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:11,094 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:11,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:11,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:11,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,163 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 18:41:11,165 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 18:41:11,165 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 89 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,185 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 89 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 163 states and 251 transitions. Complement of second has 5 states. [2025-04-26 18:41:11,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-04-26 18:41:11,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:41:11,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:41:11,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,187 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 18:41:11,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 251 transitions. [2025-04-26 18:41:11,190 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:11,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 106 states and 163 transitions. [2025-04-26 18:41:11,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 18:41:11,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-04-26 18:41:11,191 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 163 transitions. [2025-04-26 18:41:11,191 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:11,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 163 transitions. [2025-04-26 18:41:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 163 transitions. [2025-04-26 18:41:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-04-26 18:41:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.5377358490566038) internal successors, (in total 163), 105 states have internal predecessors, (163), 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 18:41:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 163 transitions. [2025-04-26 18:41:11,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 163 transitions. [2025-04-26 18:41:11,197 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 163 transitions. [2025-04-26 18:41:11,197 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:11,197 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 163 transitions. [2025-04-26 18:41:11,197 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 18:41:11,198 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:11,198 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:11,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:11,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:11,199 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 18:41:11,199 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 18:41:11,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash -314733362, now seen corresponding path program 1 times [2025-04-26 18:41:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845816764] [2025-04-26 18:41:11,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:11,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:11,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:11,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:11,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 3 times [2025-04-26 18:41:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538864609] [2025-04-26 18:41:11,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:11,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -955078415, now seen corresponding path program 1 times [2025-04-26 18:41:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490915678] [2025-04-26 18:41:11,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:11,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:11,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:11,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:11,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,427 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:11,427 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:11,427 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:11,427 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:11,427 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:11,428 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,428 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:11,428 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:11,428 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:11,428 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:11,428 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:11,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,654 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:11,654 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,658 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 18:41:11,659 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 18:41:11,661 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 18:41:11,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,674 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,680 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 18:41:11,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,682 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 18:41:11,683 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 18:41:11,684 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 18:41:11,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,698 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:11,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,705 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 18:41:11,707 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 18:41:11,708 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 18:41:11,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,721 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,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 18:41:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,728 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 18:41:11,729 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 18:41:11,730 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 18:41:11,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,743 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:11,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,751 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 18:41:11,752 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 18:41:11,753 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 18:41:11,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,769 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,782 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 18:41:11,783 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 18:41:11,784 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 18:41:11,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:11,806 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:11,807 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,809 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 18:41:11,810 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 18:41:11,811 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:11,827 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 18:41:11,827 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:11,827 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:11,827 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 18:41:11,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:41:11,836 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:11,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:11,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:11,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,888 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 18:41:11,888 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 18:41:11,889 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 18:41:11,908 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 146 states and 229 transitions. Complement of second has 5 states. [2025-04-26 18:41:11,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 18:41:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-26 18:41:11,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:11,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,911 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:11,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:11,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:11,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:11,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:11,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:11,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:11,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:11,967 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 18:41:11,968 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:11,968 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 18:41:11,990 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 158 states and 249 transitions. Complement of second has 7 states. [2025-04-26 18:41:11,991 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 18:41:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 18:41:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-04-26 18:41:11,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:11,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:11,992 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:12,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:12,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:12,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,067 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 18:41:12,068 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:12,068 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 18:41:12,099 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 163 transitions. cyclomatic complexity: 71. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 199 states and 319 transitions. Complement of second has 4 states. [2025-04-26 18:41:12,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 18:41:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 18:41:12,100 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:41:12,101 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,101 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:12,101 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,101 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 18:41:12,101 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 319 transitions. [2025-04-26 18:41:12,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:12,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 0 states and 0 transitions. [2025-04-26 18:41:12,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:12,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:12,104 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:12,104 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:12,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,104 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,104 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:12,104 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:12,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:12,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:12,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:12,128 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:12 BoogieIcfgContainer [2025-04-26 18:41:12,128 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:12,129 INFO L158 Benchmark]: Toolchain (without parser) took 3628.42ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 87.2MB in the beginning and 33.0MB in the end (delta: 54.3MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,129 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.40ms. Allocated memory is still 155.2MB. Free memory was 87.2MB in the beginning and 85.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,130 INFO L158 Benchmark]: Boogie Preprocessor took 25.58ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 996.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,130 INFO L158 Benchmark]: RCFGBuilder took 200.39ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 74.4MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,130 INFO L158 Benchmark]: BuchiAutomizer took 3361.23ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 74.4MB in the beginning and 33.0MB in the end (delta: 41.4MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,131 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.40ms. Allocated memory is still 155.2MB. Free memory was 87.2MB in the beginning and 85.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.58ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 996.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 200.39ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 74.4MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3361.23ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 74.4MB in the beginning and 33.0MB in the end (delta: 41.4MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 92 StatesRemovedByMinimization, 2 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 106 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp92 ukn78 mio100 lsp62 div100 bol113 ite100 ukn100 eq171 hnf89 smp100 dnf177 smp74 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 198, Number of transitions in reduction automaton: 82, Number of states in reduction automaton: 59, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:12,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...