/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 16:54:15,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:15,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:15,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:15,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:15,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:15,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:15,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:15,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:15,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:15,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:15,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:15,358 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:15,359 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:15,359 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:15,359 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:15,359 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:15,359 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:15,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:15,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:15,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:15,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:15,361 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:15,361 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:15,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:15,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:15,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:15,561 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:15,561 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:15,562 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 16:54:15,562 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 16:54:15,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:15,581 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:15,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:15,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:15,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:15,590 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,610 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,614 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:15,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:15,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:15,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:15,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:15,621 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,621 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,622 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,623 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,625 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,626 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,627 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,628 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,628 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:15,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:15,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:15,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:15,639 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 04:54:15" (1/1) ... [2025-04-26 16:54:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:15,685 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:15,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:15,686 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:15,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:15,686 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:15,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:15,686 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:15,720 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:15,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:15,800 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:15,800 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:15,820 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:15,820 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:54:15,822 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:15 BoogieIcfgContainer [2025-04-26 16:54:15,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:15,822 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:15,822 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:15,827 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:15,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:15,828 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 04:54:15" (1/2) ... [2025-04-26 16:54:15,829 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26557593 and model type loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:15, skipping insertion in model container [2025-04-26 16:54:15,829 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:15,829 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 04:54:15" (2/2) ... [2025-04-26 16:54:15,829 INFO L376 chiAutomizerObserver]: Analyzing ICFG loop-tiling-eq.wvr.bpl [2025-04-26 16:54:15,867 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:15,907 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:15,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:15,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 58 flow [2025-04-26 16:54:15,969 INFO L116 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-04-26 16:54:15,970 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:15,973 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 16:54:15,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 22 transitions, 58 flow [2025-04-26 16:54:15,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2025-04-26 16:54:15,975 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 22 places, 18 transitions, 48 flow [2025-04-26 16:54:15,980 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:16,001 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33#[L62, L26]true [2025-04-26 16:54:16,003 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 73#[L26, L51, L63]true [2025-04-26 16:54:16,004 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75#[L26, thread2FINAL, L63]true [2025-04-26 16:54:16,005 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77#[L26, L45, L63]true [2025-04-26 16:54:16,005 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:54:16,006 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 4 [2025-04-26 16:54:16,006 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 16:54:16,006 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 16:54:16,006 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:12 [2025-04-26 16:54:16,006 WARN L145 AmpleReduction]: Times succ was already a loop node:4 [2025-04-26 16:54:16,006 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:16,006 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:16,007 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 16:54:16,014 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:16,014 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:16,014 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:16,014 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:16,014 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:16,014 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:16,014 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:16,014 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:16,015 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 16:54:16,023 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 11 [2025-04-26 16:54:16,023 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,023 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:16,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:16,025 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:16,026 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 16:54:16,027 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 11 [2025-04-26 16:54:16,027 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,027 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:16,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:16,030 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 16:54:16,030 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 16:54:16,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 3253, now seen corresponding path program 1 times [2025-04-26 16:54:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826052964] [2025-04-26 16:54:16,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:16,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:16,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:16,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,099 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2025-04-26 16:54:16,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403691678] [2025-04-26 16:54:16,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:16,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:16,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash 100905, now seen corresponding path program 1 times [2025-04-26 16:54:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815850450] [2025-04-26 16:54:16,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,247 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,248 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,249 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,249 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:16,249 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,249 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,359 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,374 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:16,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,452 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:16,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,478 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:16,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:16,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,542 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:54:16,542 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:16,547 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:16,563 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:16,563 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,564 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, L) = -1*x + 1*L Supporting invariants [] [2025-04-26 16:54:16,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:54:16,571 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:16,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:16,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:16,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:16,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,631 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 16:54:16,632 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 16:54:16,681 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 16:54:16,682 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 16:54:16,685 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 16:54:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-04-26 16:54:16,689 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:16,691 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,691 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:16,691 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,691 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:16,691 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 126 transitions. [2025-04-26 16:54:16,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:54:16,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 25 states and 55 transitions. [2025-04-26 16:54:16,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 16:54:16,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-04-26 16:54:16,701 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 55 transitions. [2025-04-26 16:54:16,701 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:16,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 55 transitions. [2025-04-26 16:54:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 55 transitions. [2025-04-26 16:54:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-04-26 16:54:16,718 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 16:54:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2025-04-26 16:54:16,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 46 transitions. [2025-04-26 16:54:16,720 INFO L438 stractBuchiCegarLoop]: Abstraction has 21 states and 46 transitions. [2025-04-26 16:54:16,720 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:16,720 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 46 transitions. [2025-04-26 16:54:16,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:54:16,721 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,721 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:16,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:16,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]" [2025-04-26 16:54:16,722 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 16:54:16,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 3128522, now seen corresponding path program 1 times [2025-04-26 16:54:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386122939] [2025-04-26 16:54:16,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:16,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:16,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:16,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:16,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2025-04-26 16:54:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313362580] [2025-04-26 16:54:16,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:16,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:16,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:16,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:16,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1288455540, now seen corresponding path program 1 times [2025-04-26 16:54:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366042335] [2025-04-26 16:54:16,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:16,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:16,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:16,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:16,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,779 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,779 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,779 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:16,779 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,779 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,779 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,779 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:54:16,779 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,779 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,819 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,819 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:16,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:16,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:16,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:16,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:54:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:16,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:16,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:16,921 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:16,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,926 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,926 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,926 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,926 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,926 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,926 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,927 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,927 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:54:16,927 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,927 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,959 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,959 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:16,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,981 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:16,981 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:54:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:16,985 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,989 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:54:16,989 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,989 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:54:16,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:16,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:17,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:17,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:17,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:17,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:17,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,033 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:17,047 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:17,047 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 16:54:17,070 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 16:54:17,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 16:54:17,071 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:17,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:17,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:54:17,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 93 transitions. [2025-04-26 16:54:17,075 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:17,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 93 transitions. [2025-04-26 16:54:17,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:54:17,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-04-26 16:54:17,075 INFO L74 IsDeterministic]: Start isDeterministic. Operand 40 states and 93 transitions. [2025-04-26 16:54:17,075 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:17,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 93 transitions. [2025-04-26 16:54:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 93 transitions. [2025-04-26 16:54:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-04-26 16:54:17,078 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 16:54:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 85 transitions. [2025-04-26 16:54:17,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 85 transitions. [2025-04-26 16:54:17,079 INFO L438 stractBuchiCegarLoop]: Abstraction has 35 states and 85 transitions. [2025-04-26 16:54:17,079 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:17,079 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 85 transitions. [2025-04-26 16:54:17,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:17,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:17,080 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:17,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:54:17,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:17,080 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 16:54:17,080 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 16:54:17,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash 96984248, now seen corresponding path program 1 times [2025-04-26 16:54:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354343426] [2025-04-26 16:54:17,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:17,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:17,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2025-04-26 16:54:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852393685] [2025-04-26 16:54:17,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:17,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161057590] [2025-04-26 16:54:17,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,105 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 16:54:17,106 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 16:54:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1288455539, now seen corresponding path program 1 times [2025-04-26 16:54:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798551425] [2025-04-26 16:54:17,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:17,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:17,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974748510] [2025-04-26 16:54:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,146 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 16:54:17,148 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 16:54:17,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:17,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:17,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:17,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,236 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:17,237 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:17,237 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:17,237 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:17,237 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:17,237 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,237 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:17,237 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:17,237 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:17,237 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:17,237 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:17,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,323 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:17,323 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:17,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,326 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:17,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:17,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:17,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:17,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:17,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:17,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:17,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:17,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,356 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:17,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:17,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:17,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:17,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:17,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:17,377 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:17,385 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:17,385 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:17,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,388 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:17,390 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:17,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:17,406 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:17,407 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:17,407 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:54:17,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:17,412 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:17,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:17,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:17,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:17,445 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 16:54:17,445 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 16:54:17,470 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 16:54:17,472 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 16:54:17,473 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 16:54:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-04-26 16:54:17,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:54:17,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 16:54:17,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,474 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:54:17,474 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 281 transitions. [2025-04-26 16:54:17,476 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:17,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 81 states and 201 transitions. [2025-04-26 16:54:17,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 16:54:17,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 16:54:17,480 INFO L74 IsDeterministic]: Start isDeterministic. Operand 81 states and 201 transitions. [2025-04-26 16:54:17,480 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:17,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 201 transitions. [2025-04-26 16:54:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 201 transitions. [2025-04-26 16:54:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2025-04-26 16:54:17,486 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 16:54:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 136 transitions. [2025-04-26 16:54:17,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 136 transitions. [2025-04-26 16:54:17,486 INFO L438 stractBuchiCegarLoop]: Abstraction has 55 states and 136 transitions. [2025-04-26 16:54:17,486 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:17,486 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 136 transitions. [2025-04-26 16:54:17,487 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:17,487 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:17,487 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:17,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 16:54:17,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:17,488 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 16:54:17,488 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 16:54:17,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1287416010, now seen corresponding path program 2 times [2025-04-26 16:54:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479508879] [2025-04-26 16:54:17,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-04-26 16:54:17,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:17,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:17,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:17,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:17,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 2 times [2025-04-26 16:54:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310949789] [2025-04-26 16:54:17,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:17,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:17,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481957936] [2025-04-26 16:54:17,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,503 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:17,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-26 16:54:17,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:17,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1255190577, now seen corresponding path program 1 times [2025-04-26 16:54:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99051611] [2025-04-26 16:54:17,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,605 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 16:54:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:17,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99051611] [2025-04-26 16:54:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99051611] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:54:17,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853090459] [2025-04-26 16:54:17,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,608 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 16:54:17,609 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 16:54:17,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,674 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 16:54:17,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:54:17,687 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 16:54:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853090459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:54:17,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:54:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-26 16:54:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134340748] [2025-04-26 16:54:17,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:54:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:17,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:54:17,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:54:17,716 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 16:54:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:17,770 INFO L93 Difference]: Finished difference Result 120 states and 298 transitions. [2025-04-26 16:54:17,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 298 transitions. [2025-04-26 16:54:17,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:17,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 79 states and 187 transitions. [2025-04-26 16:54:17,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 16:54:17,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-04-26 16:54:17,774 INFO L74 IsDeterministic]: Start isDeterministic. Operand 79 states and 187 transitions. [2025-04-26 16:54:17,774 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:17,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 187 transitions. [2025-04-26 16:54:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 187 transitions. [2025-04-26 16:54:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2025-04-26 16:54:17,777 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 16:54:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 158 transitions. [2025-04-26 16:54:17,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 158 transitions. [2025-04-26 16:54:17,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:54:17,778 INFO L438 stractBuchiCegarLoop]: Abstraction has 65 states and 158 transitions. [2025-04-26 16:54:17,778 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:17,778 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 158 transitions. [2025-04-26 16:54:17,779 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:17,779 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:17,779 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:17,779 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:17,779 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:17,779 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 16:54:17,779 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 16:54:17,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1255189557, now seen corresponding path program 2 times [2025-04-26 16:54:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11120515] [2025-04-26 16:54:17,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:17,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:54:17,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:17,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:17,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938667357] [2025-04-26 16:54:17,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:17,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,788 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 16:54:17,790 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 16:54:17,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:54:17,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:17,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 3 times [2025-04-26 16:54:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854042878] [2025-04-26 16:54:17,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:17,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:17,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773928824] [2025-04-26 16:54:17,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,826 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 16:54:17,827 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 16:54:17,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:17,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:17,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:17,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash -256170534, now seen corresponding path program 3 times [2025-04-26 16:54:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435835197] [2025-04-26 16:54:17,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 3 equivalence classes. [2025-04-26 16:54:17,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:17,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:54:17,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:17,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674789780] [2025-04-26 16:54:17,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:17,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,874 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 16:54:17,876 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 16:54:17,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 3 equivalence classes. [2025-04-26 16:54:17,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:17,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:54:17,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:17,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:17,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,011 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:18,012 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:18,012 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:18,012 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:18,012 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:18,012 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,012 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:18,012 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:18,012 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:54:18,012 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:18,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:18,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,118 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:18,118 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,186 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:18,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:54:18,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:18,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:18,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:18,201 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:18,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:54:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,209 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 16:54:18,210 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 16:54:18,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:18,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:18,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:18,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:18,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:18,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:54:18,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,229 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 16:54:18,230 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 16:54:18,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:18,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:18,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:18,246 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:18,252 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 16:54:18,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,255 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 16:54:18,256 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 16:54:18,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:18,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:18,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:18,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:18,282 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:18,282 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:54:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,284 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 16:54:18,287 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 16:54:18,288 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:18,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:18,304 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:18,304 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:18,304 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j) = -2*j + 1 Supporting invariants [-1*M + 1 >= 0] [2025-04-26 16:54:18,309 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 16:54:18,313 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:54:18,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:18,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:18,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:18,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:18,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:18,373 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 16:54:18,373 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 16:54:18,402 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 16:54:18,402 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 16:54:18,403 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 16:54:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2025-04-26 16:54:18,403 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2025-04-26 16:54:18,403 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,403 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:18,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:18,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:18,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:18,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:18,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:18,468 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 16:54:18,468 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 16:54:18,494 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 16:54:18,494 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 16:54:18,495 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 16:54:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2025-04-26 16:54:18,495 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2025-04-26 16:54:18,495 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,495 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:18,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:18,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:18,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:18,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:18,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:18,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:18,559 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 16:54:18,560 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 16:54:18,653 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 16:54:18,654 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 16:54:18,655 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 16:54:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2025-04-26 16:54:18,655 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 8 letters. Loop has 1 letters. [2025-04-26 16:54:18,655 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,655 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 16:54:18,655 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,655 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:18,655 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 568 transitions. [2025-04-26 16:54:18,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:18,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 119 states and 267 transitions. [2025-04-26 16:54:18,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 16:54:18,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-04-26 16:54:18,663 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 267 transitions. [2025-04-26 16:54:18,663 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:18,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 267 transitions. [2025-04-26 16:54:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 267 transitions. [2025-04-26 16:54:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2025-04-26 16:54:18,683 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 16:54:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 191 transitions. [2025-04-26 16:54:18,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 191 transitions. [2025-04-26 16:54:18,684 INFO L438 stractBuchiCegarLoop]: Abstraction has 80 states and 191 transitions. [2025-04-26 16:54:18,684 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:18,684 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 191 transitions. [2025-04-26 16:54:18,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:18,685 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:18,685 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:18,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:54:18,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:18,689 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 16:54:18,689 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 16:54:18,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -256169514, now seen corresponding path program 4 times [2025-04-26 16:54:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:18,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995983104] [2025-04-26 16:54:18,689 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:18,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 9 statements into 2 equivalence classes. [2025-04-26 16:54:18,698 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 16:54:18,698 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:18,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:18,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96658061] [2025-04-26 16:54:18,699 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:18,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:18,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,704 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:18,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-26 16:54:18,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 9 statements into 2 equivalence classes. [2025-04-26 16:54:18,728 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 16:54:18,728 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:18,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:18,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:18,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:18,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 4 times [2025-04-26 16:54:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:18,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692354246] [2025-04-26 16:54:18,738 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:18,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-04-26 16:54:18,744 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 16:54:18,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:18,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325149304] [2025-04-26 16:54:18,744 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:18,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:18,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,747 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 16:54:18,748 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 16:54:18,769 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-04-26 16:54:18,771 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 16:54:18,771 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:18,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:18,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:18,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:18,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 648679727, now seen corresponding path program 5 times [2025-04-26 16:54:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:18,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912520356] [2025-04-26 16:54:18,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:54:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:18,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 10 statements into 3 equivalence classes. [2025-04-26 16:54:18,788 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:18,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 16:54:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-26 16:54:18,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731133452] [2025-04-26 16:54:18,789 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:54:18,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:18,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,791 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 16:54:18,793 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 16:54:18,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 10 statements into 3 equivalence classes. [2025-04-26 16:54:18,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:18,821 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 16:54:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:18,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:18,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:18,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,935 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:18,935 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:18,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:18,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:18,935 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:18,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:18,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:18,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:54:18,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:18,935 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:18,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,045 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:19,045 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:19,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,048 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:19,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:54:19,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:19,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:19,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:19,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:19,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:19,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:19,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:19,064 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:19,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:19,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,072 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 16:54:19,072 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 16:54:19,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:19,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:19,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:19,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:19,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:19,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:19,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:19,087 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:19,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,093 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 16:54:19,094 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 16:54:19,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:19,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:19,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:19,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:19,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:19,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:19,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:19,107 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:19,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:54:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,114 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 16:54:19,114 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 16:54:19,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:19,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:19,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:19,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:19,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:19,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:19,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:19,129 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:19,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:54:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,137 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 16:54:19,137 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 16:54:19,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:19,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:19,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:19,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:19,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:19,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:19,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:19,154 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:19,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,162 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 16:54:19,162 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 16:54:19,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:19,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:19,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:19,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:19,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:19,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:19,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:19,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:19,189 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:54:19,189 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:54:19,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:19,192 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 16:54:19,193 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 16:54:19,194 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:19,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:19,210 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:19,211 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:19,211 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, M) = -1*j + 1*M Supporting invariants [] [2025-04-26 16:54:19,216 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 16:54:19,222 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:54:19,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:19,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:19,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:19,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:19,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:19,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:19,252 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 16:54:19,252 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 16:54:19,266 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 16:54:19,267 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 16:54:19,267 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 16:54:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-04-26 16:54:19,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 16:54:19,268 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,268 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:19,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:19,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:19,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:19,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:19,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:19,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:19,298 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 16:54:19,298 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 16:54:19,319 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 16:54:19,319 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 16:54:19,319 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 16:54:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2025-04-26 16:54:19,320 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 16:54:19,320 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,320 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:19,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:19,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:19,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:19,349 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 16:54:19,350 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 16:54:19,364 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 16:54:19,365 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 16:54:19,365 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 16:54:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-26 16:54:19,365 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 1 letters. [2025-04-26 16:54:19,365 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,365 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 10 letters. Loop has 1 letters. [2025-04-26 16:54:19,365 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,365 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:54:19,365 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 459 transitions. [2025-04-26 16:54:19,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:19,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 0 states and 0 transitions. [2025-04-26 16:54:19,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:19,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:19,367 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:19,367 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:19,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:19,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:19,367 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:19,367 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:19,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:19,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:19,368 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:19,380 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 16:54:19,381 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:19 BoogieIcfgContainer [2025-04-26 16:54:19,381 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:19,382 INFO L158 Benchmark]: Toolchain (without parser) took 3800.82ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.3MB in the beginning and 55.8MB in the end (delta: 31.5MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. [2025-04-26 16:54:19,382 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:19,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.06ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 85.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:19,382 INFO L158 Benchmark]: Boogie Preprocessor took 21.58ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.4MB in the end (delta: 916.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:19,383 INFO L158 Benchmark]: RCFGBuilder took 183.07ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 74.3MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:19,383 INFO L158 Benchmark]: BuchiAutomizer took 3558.96ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.3MB in the beginning and 55.8MB in the end (delta: 18.6MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:19,385 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.17ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.06ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 85.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.58ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.4MB in the end (delta: 916.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.07ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 74.3MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3558.96ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.3MB in the beginning and 55.8MB in the end (delta: 18.6MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax: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, 161 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 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: 77ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 103, 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 16:54:19,395 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 16:54:19,595 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 16:54:19,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-26 16:54:19,995 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 16:54:20,196 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 16:54:20,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:20,596 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 16:54:20,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:20,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:21,197 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 16:54:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...