/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/loop-tiling-eq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:45,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:45,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:45,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:45,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:45,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:45,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:45,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:45,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:45,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:45,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:45,578 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:45,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:45,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:45,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:45,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:45,579 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:45,579 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:45,580 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:45,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:45,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:45,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:45,784 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:45,784 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:45,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl [2025-04-26 18:39:45,786 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl' [2025-04-26 18:39:45,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:45,805 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:45,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:45,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:45,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:45,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,833 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:45,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:45,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:45,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:45,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:45,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:45,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:45,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:45,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:45,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/1) ... [2025-04-26 18:39:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:45,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,881 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:39:45,884 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:39:45,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:45,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:45,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:45,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:45,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:45,906 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:39:45,946 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:45,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:46,038 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:46,038 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:46,060 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:46,060 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:39:46,061 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:46 BoogieIcfgContainer [2025-04-26 18:39:46,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:46,062 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:46,062 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:46,066 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:46,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:46,068 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:45" (1/2) ... [2025-04-26 18:39:46,069 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22869ef4 and model type loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:46, skipping insertion in model container [2025-04-26 18:39:46,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:46,069 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:46" (2/2) ... [2025-04-26 18:39:46,069 INFO L376 chiAutomizerObserver]: Analyzing ICFG loop-tiling-eq.wvr.bpl [2025-04-26 18:39:46,106 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:46,148 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:46,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:46,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,160 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:39:46,161 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:39:46,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 58 flow [2025-04-26 18:39:46,223 INFO L116 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-04-26 18:39:46,226 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:46,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-26 18:39:46,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 22 transitions, 58 flow [2025-04-26 18:39:46,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2025-04-26 18:39:46,232 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 22 places, 18 transitions, 48 flow [2025-04-26 18:39:46,232 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 18 transitions, 48 flow [2025-04-26 18:39:46,239 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 33 states have (on average 2.090909090909091) internal successors, (in total 69), 34 states have internal predecessors, (69), 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:39:46,240 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 35 states, 33 states have (on average 2.090909090909091) internal successors, (in total 69), 34 states have internal predecessors, (69), 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:39:46,241 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:46,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 31#[L62, L26]true [2025-04-26 18:39:46,265 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 45#[L63, L26, L51]true [2025-04-26 18:39:46,265 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55#[thread2FINAL, L63, L26]true [2025-04-26 18:39:46,266 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57#[L63, L26, L45]true [2025-04-26 18:39:46,267 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 18:39:46,267 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 4 [2025-04-26 18:39:46,267 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 18:39:46,267 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 18:39:46,267 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:12 [2025-04-26 18:39:46,267 WARN L145 AmpleReduction]: Times succ was already a loop node:4 [2025-04-26 18:39:46,267 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:39:46,267 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:46,267 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (in total 46), 27 states have internal predecessors, (46), 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:39:46,272 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:46,273 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:46,273 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:46,273 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:46,273 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:46,273 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:46,273 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:46,273 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:46,274 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (in total 46), 27 states have internal predecessors, (46), 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:39:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 11 [2025-04-26 18:39:46,282 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:46,282 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:46,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:46,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:46,285 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:46,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (in total 46), 27 states have internal predecessors, (46), 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:39:46,287 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 11 [2025-04-26 18:39:46,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:46,287 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:46,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:46,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:46,290 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" [2025-04-26 18:39:46,291 INFO L754 eck$LassoCheckResult]: Loop: "[62] L26-->L26: Formula: (and (= (store v_A_9 v_x_12 (select v_F_5 v_x_12)) v_A_8) (< v_x_12 v_L_4) (= v_x_11 (+ v_x_12 1))) InVars {A=v_A_9, x=v_x_12, F=v_F_5, L=v_L_4} OutVars{A=v_A_8, x=v_x_11, F=v_F_5, L=v_L_4} AuxVars[] AssignedVars[A, x]" [2025-04-26 18:39:46,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 3253, now seen corresponding path program 1 times [2025-04-26 18:39:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278808802] [2025-04-26 18:39:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:46,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:46,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:46,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:46,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2025-04-26 18:39:46,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99910504] [2025-04-26 18:39:46,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:46,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:46,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:46,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:46,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash 100905, now seen corresponding path program 1 times [2025-04-26 18:39:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879965152] [2025-04-26 18:39:46,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,496 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:46,496 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:46,496 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:46,496 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:46,497 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:46,497 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,497 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:46,498 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:46,498 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:46,498 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:46,498 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:46,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,641 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:46,643 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:46,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,647 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:39:46,649 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:39:46,650 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:39:46,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:46,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:46,675 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:46,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:46,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,684 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:39:46,686 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:39:46,687 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:39:46,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:46,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:46,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:46,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:46,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:46,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,707 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:39:46,709 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:39:46,709 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:39:46,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:46,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:46,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:46,723 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:46,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:46,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,730 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:39:46,731 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:39:46,733 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:39:46,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:46,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:46,755 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:46,765 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:46,766 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,771 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:39:46,771 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:39:46,772 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:46,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:46,789 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:46,789 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:46,790 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, L) = -1*x + 1*L Supporting invariants [] [2025-04-26 18:39:46,795 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:39:46,798 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:46,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:46,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:46,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:46,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:46,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:46,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:46,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:46,843 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:39:46,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:46,858 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (in total 46), 27 states have internal predecessors, (46), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:46,899 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (in total 46), 27 states have internal predecessors, (46), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 64 states and 126 transitions. Complement of second has 5 states. [2025-04-26 18:39:46,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-04-26 18:39:46,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:39:46,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:46,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:39:46,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:46,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:39:46,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:46,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 126 transitions. [2025-04-26 18:39:46,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:39:46,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 25 states and 55 transitions. [2025-04-26 18:39:46,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:39:46,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-04-26 18:39:46,912 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 55 transitions. [2025-04-26 18:39:46,912 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:46,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 55 transitions. [2025-04-26 18:39:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 55 transitions. [2025-04-26 18:39:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-04-26 18:39:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (in total 46), 20 states have internal predecessors, (46), 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:39:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2025-04-26 18:39:46,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 46 transitions. [2025-04-26 18:39:46,927 INFO L438 stractBuchiCegarLoop]: Abstraction has 21 states and 46 transitions. [2025-04-26 18:39:46,927 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:46,927 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 46 transitions. [2025-04-26 18:39:46,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:39:46,927 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:46,927 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:46,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:39:46,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:46,928 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[75] L62-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 18:39:46,928 INFO L754 eck$LassoCheckResult]: Loop: "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" "[68] L45-->L51: Formula: (and (= (+ v_i_8 1) v_i_7) (<= v_M_5 v_j_7)) InVars {M=v_M_5, i=v_i_8, j=v_j_7} OutVars{M=v_M_5, i=v_i_7, j=v_j_7} AuxVars[] AssignedVars[i]" [2025-04-26 18:39:46,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 3128522, now seen corresponding path program 1 times [2025-04-26 18:39:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071481547] [2025-04-26 18:39:46,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:46,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2025-04-26 18:39:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250186906] [2025-04-26 18:39:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:46,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:46,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:46,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1288455540, now seen corresponding path program 1 times [2025-04-26 18:39:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547479288] [2025-04-26 18:39:46,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:46,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:46,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:46,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:46,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,989 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:46,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:46,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:46,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:46,989 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:46,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:46,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:46,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:39:46,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:46,990 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:46,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,030 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:47,030 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:47,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,033 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:39:47,035 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:39:47,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:47,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:47,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,059 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:39:47,059 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:39:47,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:47,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:47,127 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:47,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,132 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:47,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:47,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:47,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:47,132 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:47,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:47,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:47,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:39:47,132 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:47,132 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:47,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,169 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:47,170 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:47,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,172 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:39:47,175 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:39:47,176 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:39:47,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:47,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:47,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:47,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:47,195 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:39:47,195 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:47,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,197 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:39:47,198 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:39:47,199 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:47,202 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:39:47,202 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:47,202 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:47,202 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:39:47,208 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:39:47,209 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:47,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:47,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:47,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:47,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:47,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,248 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:39:47,249 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:39:47,249 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 46 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,272 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 46 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 40 states and 93 transitions. Complement of second has 6 states. [2025-04-26 18:39:47,273 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:39:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 18:39:47,273 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:39:47,274 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,274 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:39:47,274 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,274 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:39:47,274 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 93 transitions. [2025-04-26 18:39:47,275 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:47,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 93 transitions. [2025-04-26 18:39:47,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 18:39:47,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-04-26 18:39:47,276 INFO L74 IsDeterministic]: Start isDeterministic. Operand 40 states and 93 transitions. [2025-04-26 18:39:47,276 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:47,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 93 transitions. [2025-04-26 18:39:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 93 transitions. [2025-04-26 18:39:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-04-26 18:39:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (in total 85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 85 transitions. [2025-04-26 18:39:47,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 85 transitions. [2025-04-26 18:39:47,278 INFO L438 stractBuchiCegarLoop]: Abstraction has 35 states and 85 transitions. [2025-04-26 18:39:47,278 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:47,278 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 85 transitions. [2025-04-26 18:39:47,279 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:47,279 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:47,279 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:47,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:47,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:47,279 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[75] L62-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" [2025-04-26 18:39:47,280 INFO L754 eck$LassoCheckResult]: Loop: "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:39:47,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash 96984248, now seen corresponding path program 1 times [2025-04-26 18:39:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:47,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204059719] [2025-04-26 18:39:47,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:47,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:47,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:47,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:47,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:47,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:47,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2025-04-26 18:39:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:47,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634490931] [2025-04-26 18:39:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:47,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:47,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744677325] [2025-04-26 18:39:47,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-26 18:39:47,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:47,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:47,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1288455539, now seen corresponding path program 1 times [2025-04-26 18:39:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:47,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834915361] [2025-04-26 18:39:47,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:47,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:47,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:47,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:47,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231512403] [2025-04-26 18:39:47,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-26 18:39:47,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:47,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:47,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:47,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:47,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:47,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:47,451 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:47,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:47,452 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:47,452 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:47,452 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:47,452 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,452 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:47,452 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:47,452 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:47,452 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:47,452 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:47,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:47,538 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:47,538 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,541 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:39:47,543 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:39:47,544 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:39:47,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:47,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:47,562 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:47,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,571 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:39:47,571 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:39:47,573 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:39:47,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:47,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:47,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:47,586 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:47,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,594 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:39:47,596 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:39:47,597 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:39:47,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:47,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:47,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:47,623 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:47,623 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:47,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,625 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:39:47,627 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:39:47,629 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:47,645 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:39:47,645 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:47,645 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:47,645 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:39:47,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,651 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:47,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:47,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:47,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,680 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:39:47,681 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:47,681 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 85 transitions. cyclomatic complexity: 62 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,705 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 85 transitions. cyclomatic complexity: 62. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 120 states and 281 transitions. Complement of second has 5 states. [2025-04-26 18:39:47,706 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:39:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-04-26 18:39:47,707 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:39:47,707 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,707 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:39:47,708 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,708 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:47,708 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 281 transitions. [2025-04-26 18:39:47,714 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:47,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 81 states and 201 transitions. [2025-04-26 18:39:47,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 18:39:47,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 18:39:47,715 INFO L74 IsDeterministic]: Start isDeterministic. Operand 81 states and 201 transitions. [2025-04-26 18:39:47,715 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:47,715 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 201 transitions. [2025-04-26 18:39:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 201 transitions. [2025-04-26 18:39:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2025-04-26 18:39:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.4727272727272727) internal successors, (in total 136), 54 states have internal predecessors, (136), 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:39:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 136 transitions. [2025-04-26 18:39:47,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 136 transitions. [2025-04-26 18:39:47,720 INFO L438 stractBuchiCegarLoop]: Abstraction has 55 states and 136 transitions. [2025-04-26 18:39:47,720 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:47,720 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 136 transitions. [2025-04-26 18:39:47,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:47,721 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:47,721 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:47,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 18:39:47,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:47,722 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[75] L62-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" "[68] L45-->L51: Formula: (and (= (+ v_i_8 1) v_i_7) (<= v_M_5 v_j_7)) InVars {M=v_M_5, i=v_i_8, j=v_j_7} OutVars{M=v_M_5, i=v_i_7, j=v_j_7} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" [2025-04-26 18:39:47,722 INFO L754 eck$LassoCheckResult]: Loop: "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:39:47,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1287416010, now seen corresponding path program 2 times [2025-04-26 18:39:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:47,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411003783] [2025-04-26 18:39:47,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:47,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-04-26 18:39:47,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:47,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:47,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:47,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:47,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:47,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:47,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 2 times [2025-04-26 18:39:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:47,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390443999] [2025-04-26 18:39:47,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:47,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:47,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:47,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37621715] [2025-04-26 18:39:47,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:47,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,747 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-26 18:39:47,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:47,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:47,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:47,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1255190577, now seen corresponding path program 1 times [2025-04-26 18:39:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:47,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956211649] [2025-04-26 18:39:47,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:47,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:47,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:47,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:47,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956211649] [2025-04-26 18:39:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956211649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:39:47,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52318688] [2025-04-26 18:39:47,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:47,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:47,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,858 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-26 18:39:47,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:47,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:47,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:47,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:39:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52318688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:39:47,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:39:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-26 18:39:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196166575] [2025-04-26 18:39:47,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:39:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:47,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:39:47,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:39:47,972 INFO L87 Difference]: Start difference. First operand 55 states and 136 transitions. cyclomatic complexity: 99 Second operand has 6 states, 5 states have (on average 2.0) internal successors, (in total 10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:48,014 INFO L93 Difference]: Finished difference Result 120 states and 298 transitions. [2025-04-26 18:39:48,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 298 transitions. [2025-04-26 18:39:48,017 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:48,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 79 states and 187 transitions. [2025-04-26 18:39:48,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 18:39:48,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-04-26 18:39:48,018 INFO L74 IsDeterministic]: Start isDeterministic. Operand 79 states and 187 transitions. [2025-04-26 18:39:48,018 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:48,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 187 transitions. [2025-04-26 18:39:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 187 transitions. [2025-04-26 18:39:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2025-04-26 18:39:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.4307692307692306) internal successors, (in total 158), 64 states have internal predecessors, (158), 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:39:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 158 transitions. [2025-04-26 18:39:48,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 158 transitions. [2025-04-26 18:39:48,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:39:48,025 INFO L438 stractBuchiCegarLoop]: Abstraction has 65 states and 158 transitions. [2025-04-26 18:39:48,025 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:48,025 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 158 transitions. [2025-04-26 18:39:48,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:48,026 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:48,026 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:48,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:48,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:48,026 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[75] L62-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" "[68] L45-->L51: Formula: (and (= (+ v_i_8 1) v_i_7) (<= v_M_5 v_j_7)) InVars {M=v_M_5, i=v_i_8, j=v_j_7} OutVars{M=v_M_5, i=v_i_7, j=v_j_7} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" [2025-04-26 18:39:48,026 INFO L754 eck$LassoCheckResult]: Loop: "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:39:48,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1255189557, now seen corresponding path program 2 times [2025-04-26 18:39:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:48,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300796210] [2025-04-26 18:39:48,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:48,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 18:39:48,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:48,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:48,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:48,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868735371] [2025-04-26 18:39:48,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:48,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:48,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,039 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:48,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-26 18:39:48,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 18:39:48,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:48,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:48,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:48,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:48,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:48,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:48,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 3 times [2025-04-26 18:39:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:48,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635480349] [2025-04-26 18:39:48,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:48,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:48,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:48,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803387734] [2025-04-26 18:39:48,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:48,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,076 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:48,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-26 18:39:48,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:48,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:48,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -256170534, now seen corresponding path program 3 times [2025-04-26 18:39:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:48,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360250087] [2025-04-26 18:39:48,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:48,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:48,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 3 equivalence classes. [2025-04-26 18:39:48,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:48,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 18:39:48,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:48,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973922651] [2025-04-26 18:39:48,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:48,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,116 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:48,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-26 18:39:48,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 3 equivalence classes. [2025-04-26 18:39:48,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:48,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 18:39:48,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:48,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:48,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:48,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:48,241 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:48,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:48,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:48,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:48,242 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:48,242 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:48,242 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:48,242 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:48,242 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:39:48,242 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:48,242 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:48,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:48,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:48,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:48,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:48,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:48,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:48,338 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:48,339 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:48,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,342 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39:48,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:39:48,344 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:39:48,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:48,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:48,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:48,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:48,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:48,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:48,358 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:48,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,365 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39:48,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:39:48,367 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:39:48,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:48,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:48,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:48,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:48,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:48,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:48,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:48,378 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:48,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:39:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,386 INFO L229 MonitoredProcess]: Starting monitored process 25 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:39:48,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:39:48,387 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:39:48,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:48,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:48,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:48,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:48,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:48,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:48,403 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:48,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:39:48,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:48,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,411 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39:48,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:39:48,413 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:39:48,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:48,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:48,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:48,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:48,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:48,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:48,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:48,437 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:48,437 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:48,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:48,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,439 INFO L229 MonitoredProcess]: Starting monitored process 27 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:39:48,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:39:48,441 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:48,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:48,459 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:39:48,459 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:48,459 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j) = -2*j + 1 Supporting invariants [-1*M + 1 >= 0] [2025-04-26 18:39:48,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:39:48,468 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:39:48,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:48,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:48,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:48,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:48,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:48,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:48,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:48,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:48,532 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:39:48,532 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2025-04-26 18:39:48,532 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 158 transitions. cyclomatic complexity: 111 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,557 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 158 transitions. cyclomatic complexity: 111. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 69 states and 168 transitions. Complement of second has 3 states. [2025-04-26 18:39:48,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2025-04-26 18:39:48,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2025-04-26 18:39:48,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:48,558 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:39:48,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:48,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:48,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:48,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:48,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:48,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:48,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:48,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:48,618 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:39:48,618 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2025-04-26 18:39:48,618 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 158 transitions. cyclomatic complexity: 111 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,646 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 158 transitions. cyclomatic complexity: 111. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 69 states and 168 transitions. Complement of second has 3 states. [2025-04-26 18:39:48,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2025-04-26 18:39:48,647 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2025-04-26 18:39:48,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:48,647 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:39:48,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:48,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:48,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:48,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:48,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:48,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:48,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:48,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:48,713 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:39:48,713 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2025-04-26 18:39:48,713 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 158 transitions. cyclomatic complexity: 111 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,837 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 158 transitions. cyclomatic complexity: 111. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 248 states and 568 transitions. Complement of second has 11 states. [2025-04-26 18:39:48,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-04-26 18:39:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2025-04-26 18:39:48,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 8 letters. Loop has 1 letters. [2025-04-26 18:39:48,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:48,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 18:39:48,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:48,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:39:48,840 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:48,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 568 transitions. [2025-04-26 18:39:48,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:48,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 119 states and 267 transitions. [2025-04-26 18:39:48,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:39:48,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-04-26 18:39:48,844 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 267 transitions. [2025-04-26 18:39:48,844 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:48,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 267 transitions. [2025-04-26 18:39:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 267 transitions. [2025-04-26 18:39:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2025-04-26 18:39:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.3875) internal successors, (in total 191), 79 states have internal predecessors, (191), 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:39:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 191 transitions. [2025-04-26 18:39:48,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 191 transitions. [2025-04-26 18:39:48,847 INFO L438 stractBuchiCegarLoop]: Abstraction has 80 states and 191 transitions. [2025-04-26 18:39:48,847 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:48,847 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 191 transitions. [2025-04-26 18:39:48,848 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:48,848 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:48,848 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:48,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 18:39:48,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:48,849 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[75] L62-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" "[68] L45-->L51: Formula: (and (= (+ v_i_8 1) v_i_7) (<= v_M_5 v_j_7)) InVars {M=v_M_5, i=v_i_8, j=v_j_7} OutVars{M=v_M_5, i=v_i_7, j=v_j_7} AuxVars[] AssignedVars[i]" "[66] L51-->L45: Formula: (and (= v_j_17 0) (< v_i_15 v_N_4)) InVars {i=v_i_15, N=v_N_4} OutVars{i=v_i_15, N=v_N_4, j=v_j_17} AuxVars[] AssignedVars[j]" [2025-04-26 18:39:48,849 INFO L754 eck$LassoCheckResult]: Loop: "[69] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_14 (select v_F_9 (+ v_j_14 (* v_i_13 v_M_9))))) v_B_8) (< v_j_14 v_M_9) (= (+ v_j_14 1) v_j_13)) InVars {i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_14, B=v_B_9} OutVars{i=v_i_13, F=v_F_9, M=v_M_9, j=v_j_13, B=v_B_8} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:39:48,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -256169514, now seen corresponding path program 4 times [2025-04-26 18:39:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:48,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8376443] [2025-04-26 18:39:48,849 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:48,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 9 statements into 2 equivalence classes. [2025-04-26 18:39:48,859 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:48,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:48,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:48,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75118185] [2025-04-26 18:39:48,860 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:48,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,865 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:48,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-26 18:39:48,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 9 statements into 2 equivalence classes. [2025-04-26 18:39:48,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:48,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:48,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:48,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:48,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:48,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:48,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 4 times [2025-04-26 18:39:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:48,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648186425] [2025-04-26 18:39:48,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:48,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-04-26 18:39:48,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,901 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:48,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:48,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80991672] [2025-04-26 18:39:48,901 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,904 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:48,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-26 18:39:48,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-04-26 18:39:48,925 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,925 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:48,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:48,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 648679727, now seen corresponding path program 5 times [2025-04-26 18:39:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:48,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239517633] [2025-04-26 18:39:48,931 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:39:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:48,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 10 statements into 3 equivalence classes. [2025-04-26 18:39:48,943 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:48,943 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 18:39:48,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 18:39:48,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143933790] [2025-04-26 18:39:48,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:39:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:48,947 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:48,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-26 18:39:48,969 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 10 statements into 3 equivalence classes. [2025-04-26 18:39:48,975 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:48,975 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 18:39:48,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:48,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:48,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:48,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:48,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:48,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,090 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:49,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:49,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:49,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:49,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:49,091 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,091 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:49,091 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:49,091 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:49,091 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:49,091 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:49,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:49,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:49,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,204 INFO L229 MonitoredProcess]: Starting monitored process 31 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:39:49,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:39:49,205 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:39:49,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,220 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:39:49,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,229 INFO L229 MonitoredProcess]: Starting monitored process 32 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:39:49,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:39:49,231 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:39:49,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,244 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,252 INFO L229 MonitoredProcess]: Starting monitored process 33 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:39:49,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:39:49,255 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:39:49,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,272 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,280 INFO L229 MonitoredProcess]: Starting monitored process 34 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:39:49,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:39:49,283 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:39:49,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,297 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:39:49,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,305 INFO L229 MonitoredProcess]: Starting monitored process 35 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:39:49,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:39:49,308 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:39:49,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,330 INFO L229 MonitoredProcess]: Starting monitored process 36 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:39:49,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:39:49,331 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:39:49,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:49,357 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:39:49,358 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,360 INFO L229 MonitoredProcess]: Starting monitored process 37 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:39:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:39:49,362 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,379 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:49,379 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:49,379 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, M) = -1*j + 1*M Supporting invariants [] [2025-04-26 18:39:49,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 18:39:49,390 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:39:49,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:49,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:49,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:49,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:49,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:49,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:49,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:49,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:49,424 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:39:49,425 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:49,425 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 191 transitions. cyclomatic complexity: 130 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,438 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 191 transitions. cyclomatic complexity: 130. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 159 states and 359 transitions. Complement of second has 5 states. [2025-04-26 18:39:49,439 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:39:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-04-26 18:39:49,439 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 18:39:49,439 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:49,439 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:39:49,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:49,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:49,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:49,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:49,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:49,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:49,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:49,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:49,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:49,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:49,472 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:39:49,472 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:49,472 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 191 transitions. cyclomatic complexity: 130 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,488 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 191 transitions. cyclomatic complexity: 130. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 159 states and 359 transitions. Complement of second has 5 states. [2025-04-26 18:39:49,488 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:39:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-04-26 18:39:49,489 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 18:39:49,489 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:49,489 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:39:49,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:49,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:49,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:49,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:49,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:49,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:49,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:49,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:49,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:49,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:49,519 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:39:49,519 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 1 loop predicates [2025-04-26 18:39:49,519 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 191 transitions. cyclomatic complexity: 130 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,533 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 191 transitions. cyclomatic complexity: 130. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 200 states and 459 transitions. Complement of second has 4 states. [2025-04-26 18:39:49,533 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:39:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-26 18:39:49,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 18:39:49,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:49,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 10 letters. Loop has 1 letters. [2025-04-26 18:39:49,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:49,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:39:49,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:49,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 459 transitions. [2025-04-26 18:39:49,537 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:49,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 0 states and 0 transitions. [2025-04-26 18:39:49,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:49,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:49,537 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:49,537 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:49,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:49,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:49,537 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:49,537 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:49,538 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:49,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:49,538 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:49,547 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:39:49,549 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:49 BoogieIcfgContainer [2025-04-26 18:39:49,549 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:49,549 INFO L158 Benchmark]: Toolchain (without parser) took 3743.96ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 89.9MB in the beginning and 50.9MB in the end (delta: 39.0MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2025-04-26 18:39:49,549 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:49,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.38ms. Allocated memory is still 163.6MB. Free memory was 89.1MB in the beginning and 87.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:49,550 INFO L158 Benchmark]: Boogie Preprocessor took 19.47ms. Allocated memory is still 163.6MB. Free memory was 87.3MB in the beginning and 86.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:49,550 INFO L158 Benchmark]: RCFGBuilder took 207.25ms. Allocated memory is still 163.6MB. Free memory was 86.1MB in the beginning and 76.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:49,550 INFO L158 Benchmark]: BuchiAutomizer took 3486.21ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 76.3MB in the beginning and 50.9MB in the end (delta: 25.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:49,551 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 163.6MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.38ms. Allocated memory is still 163.6MB. Free memory was 89.1MB in the beginning and 87.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.47ms. Allocated memory is still 163.6MB. Free memory was 87.3MB in the beginning and 86.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 207.25ms. Allocated memory is still 163.6MB. Free memory was 86.1MB in the beginning and 76.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3486.21ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 76.3MB in the beginning and 50.9MB in the end (delta: 25.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 88 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 71 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital41 mio100 ax100 hnf100 lsp74 ukn71 mio100 lsp83 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf103 neg100 sie100 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: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 122, Number of transitions in reduction automaton: 46, Number of states in reduction automaton: 28, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * x + L and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 1 and consists of 8 locations. One nondeterministic module has affine ranking function M + -1 * j and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:49,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-26 18:39:49,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-26 18:39:50,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-26 18:39:50,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-26 18:39:51,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-26 18:39:51,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:51,566 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...