/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:06,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:06,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:06,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:06,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:06,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:06,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:06,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:06,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:06,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:06,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:06,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:06,087 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:06,087 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:06,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:06,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:06,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:06,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:06,089 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:06,089 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:06,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:06,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:06,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:06,309 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:06,309 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:06,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product.wvr.bpl [2025-04-26 18:41:06,311 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product.wvr.bpl' [2025-04-26 18:41:06,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:06,332 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:06,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:06,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:06,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:06,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,367 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:06,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:06,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:06,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:06,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:06,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:06,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:06,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:06,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:06,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/1) ... [2025-04-26 18:41:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:06,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:06,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:06,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:06,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:06,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:06,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:06,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:06,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:06,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:06,438 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:06,472 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:06,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:06,549 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:06,549 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:06,572 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:06,572 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:06,573 INFO L201 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:06 BoogieIcfgContainer [2025-04-26 18:41:06,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:06,575 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:06,576 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:06,580 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:06,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:06,580 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:06" (1/2) ... [2025-04-26 18:41:06,582 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f86a077 and model type dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:06, skipping insertion in model container [2025-04-26 18:41:06,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:06,582 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:06" (2/2) ... [2025-04-26 18:41:06,583 INFO L376 chiAutomizerObserver]: Analyzing ICFG dot-product.wvr.bpl [2025-04-26 18:41:06,619 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:06,661 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:06,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:06,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:06,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:06,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:06,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:41:06,733 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:41:06,735 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:06,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:41:06,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:41:06,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:06,740 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:06,741 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:06,758 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 114 states, 112 states have (on average 2.8035714285714284) internal successors, (in total 314), 113 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,759 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 114 states, 112 states have (on average 2.8035714285714284) internal successors, (in total 314), 113 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,760 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:06,817 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:41:06,817 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:06,818 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:41:06,818 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:41:06,818 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:41:06,818 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:41:06,818 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:06,818 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:06,819 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,825 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:06,825 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:06,825 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:06,825 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:06,825 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:06,825 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:06,825 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:06,825 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:06,827 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,837 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:06,838 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:06,838 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:06,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:06,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:06,840 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:06,841 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,845 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:06,845 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:06,845 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:06,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:06,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:06,849 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:06,849 INFO L754 eck$LassoCheckResult]: Loop: "[68] L24-1-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" [2025-04-26 18:41:06,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 87810836, now seen corresponding path program 1 times [2025-04-26 18:41:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:06,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059719360] [2025-04-26 18:41:06,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:06,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:06,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:06,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:06,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:06,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:06,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:06,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 18:41:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:06,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39013126] [2025-04-26 18:41:06,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:06,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:06,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:06,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1513130346, now seen corresponding path program 1 times [2025-04-26 18:41:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:06,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161630291] [2025-04-26 18:41:06,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:06,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:06,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:06,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:06,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:06,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:06,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:06,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:07,137 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:07,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:07,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:07,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:07,138 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:07,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:07,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:07,139 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:07,139 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:07,139 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:07,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,356 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:07,359 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:07,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:07,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:07,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:07,391 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:07,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:07,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:07,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:07,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:07,423 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:07,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:07,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:07,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:07,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:07,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:07,446 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:07,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:07,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:07,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:07,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:07,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:07,467 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:07,473 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 18:41:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:07,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:07,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:07,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:07,514 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:07,514 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:41:07,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:07,533 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:07,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:07,549 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:07,549 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:07,549 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:07,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:07,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:07,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:07,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:07,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,644 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:07,646 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,740 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 260 states and 529 transitions. Complement of second has 7 states. [2025-04-26 18:41:07,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-26 18:41:07,753 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:07,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:07,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:41:07,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 529 transitions. [2025-04-26 18:41:07,761 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:07,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 119 states and 241 transitions. [2025-04-26 18:41:07,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 18:41:07,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 18:41:07,771 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 241 transitions. [2025-04-26 18:41:07,771 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:07,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 241 transitions. [2025-04-26 18:41:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 241 transitions. [2025-04-26 18:41:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2025-04-26 18:41:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.019230769230769) internal successors, (in total 210), 103 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2025-04-26 18:41:07,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 18:41:07,792 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 18:41:07,792 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:07,792 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 210 transitions. [2025-04-26 18:41:07,793 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:07,793 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:07,793 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:07,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:07,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:07,793 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L60-1-->L35-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:07,793 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L35: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L35-->L35-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ (select (select v_mult_6 (select v_A_6 v_j_8)) (select v_B_6 v_j_8)) v_res2_8) v_res2_7)) InVars {A=v_A_6, res2=v_res2_8, j=v_j_8, mult=v_mult_6, B=v_B_6} OutVars{A=v_A_6, res2=v_res2_7, j=v_j_7, mult=v_mult_6, B=v_B_6} AuxVars[] AssignedVars[j, res2]" [2025-04-26 18:41:07,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash 337598622, now seen corresponding path program 1 times [2025-04-26 18:41:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167658427] [2025-04-26 18:41:07,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:07,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:07,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:07,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:07,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167658427] [2025-04-26 18:41:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167658427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616542050] [2025-04-26 18:41:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:07,848 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:07,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 18:41:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122389025] [2025-04-26 18:41:07,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:07,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:07,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:07,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:07,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:07,890 INFO L87 Difference]: Start difference. First operand 104 states and 210 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:07,931 INFO L93 Difference]: Finished difference Result 106 states and 212 transitions. [2025-04-26 18:41:07,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 212 transitions. [2025-04-26 18:41:07,932 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:07,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 18:41:07,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 18:41:07,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:41:07,933 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 212 transitions. [2025-04-26 18:41:07,934 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:07,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 18:41:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 212 transitions. [2025-04-26 18:41:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-26 18:41:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.0096153846153846) internal successors, (in total 209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 209 transitions. [2025-04-26 18:41:07,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 18:41:07,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:07,939 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 18:41:07,939 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:07,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 209 transitions. [2025-04-26 18:41:07,940 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:07,940 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:07,940 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:07,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:07,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:07,940 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L24-1-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L60-1-->L35-1: 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]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:07,941 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L35: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L35-->L35-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ (select (select v_mult_6 (select v_A_6 v_j_8)) (select v_B_6 v_j_8)) v_res2_8) v_res2_7)) InVars {A=v_A_6, res2=v_res2_8, j=v_j_8, mult=v_mult_6, B=v_B_6} OutVars{A=v_A_6, res2=v_res2_7, j=v_j_7, mult=v_mult_6, B=v_B_6} AuxVars[] AssignedVars[j, res2]" [2025-04-26 18:41:07,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1875666529, now seen corresponding path program 1 times [2025-04-26 18:41:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701433415] [2025-04-26 18:41:07,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:07,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:07,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:07,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:07,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:07,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:07,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 2 times [2025-04-26 18:41:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374055458] [2025-04-26 18:41:07,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:07,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:07,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:07,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1370727645, now seen corresponding path program 1 times [2025-04-26 18:41:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942523833] [2025-04-26 18:41:07,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:07,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:07,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:08,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:08,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942523833] [2025-04-26 18:41:08,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942523833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:08,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:08,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:41:08,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249294560] [2025-04-26 18:41:08,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:08,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:08,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:08,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:08,064 INFO L87 Difference]: Start difference. First operand 104 states and 209 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:08,156 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2025-04-26 18:41:08,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 290 transitions. [2025-04-26 18:41:08,158 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 18:41:08,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 152 states and 288 transitions. [2025-04-26 18:41:08,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 18:41:08,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 18:41:08,159 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 288 transitions. [2025-04-26 18:41:08,159 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:08,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 288 transitions. [2025-04-26 18:41:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 288 transitions. [2025-04-26 18:41:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-04-26 18:41:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.983739837398374) internal successors, (in total 244), 122 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 244 transitions. [2025-04-26 18:41:08,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 18:41:08,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:08,165 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 18:41:08,165 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:08,165 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 244 transitions. [2025-04-26 18:41:08,165 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:08,166 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:08,166 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:08,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:08,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:08,166 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L24-1-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L60-1-->L35-1: 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]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[68] L24-1-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:08,166 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L35: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L35-->L35-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ (select (select v_mult_6 (select v_A_6 v_j_8)) (select v_B_6 v_j_8)) v_res2_8) v_res2_7)) InVars {A=v_A_6, res2=v_res2_8, j=v_j_8, mult=v_mult_6, B=v_B_6} OutVars{A=v_A_6, res2=v_res2_7, j=v_j_7, mult=v_mult_6, B=v_B_6} AuxVars[] AssignedVars[j, res2]" [2025-04-26 18:41:08,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1370726753, now seen corresponding path program 2 times [2025-04-26 18:41:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435267769] [2025-04-26 18:41:08,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 18:41:08,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:08,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:08,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:08,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:08,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:08,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 3 times [2025-04-26 18:41:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925391741] [2025-04-26 18:41:08,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:08,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:08,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:08,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:08,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:08,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:08,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1286552545, now seen corresponding path program 2 times [2025-04-26 18:41:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901371725] [2025-04-26 18:41:08,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 18:41:08,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:08,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:08,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:08,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:08,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:08,351 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:08,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:08,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:08,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:08,351 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:08,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:08,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:08,351 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:08,351 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:08,351 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:08,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:08,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:08,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:08,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:08,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:08,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:08,542 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:08,542 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:08,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:08,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:08,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:08,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:08,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:08,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:08,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:08,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:08,560 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:08,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:08,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:08,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:08,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:08,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:08,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:08,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:08,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:08,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:08,590 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 18:41:08,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:08,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:08,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:08,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:08,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:08,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:08,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:08,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:08,609 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:08,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:08,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:08,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:08,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:08,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:08,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:08,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:08,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:08,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:08,641 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:08,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:08,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:08,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:08,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:08,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:08,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:08,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:08,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:08,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:08,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:08,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,673 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:08,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:08,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:08,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:08,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:08,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:08,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:08,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:08,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:08,707 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:08,707 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:41:08,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:08,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:08,712 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:08,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:08,728 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:08,728 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:08,728 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:41:08,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:08,736 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:08,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:08,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:08,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:08,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:08,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:08,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:08,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:08,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:08,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:08,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:08,786 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:08,786 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,847 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 267 states and 557 transitions. Complement of second has 6 states. [2025-04-26 18:41:08,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:41:08,848 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:08,848 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:08,848 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:08,848 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:08,848 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:08,848 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:08,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 557 transitions. [2025-04-26 18:41:08,852 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:08,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 158 states and 310 transitions. [2025-04-26 18:41:08,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 18:41:08,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 18:41:08,854 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 310 transitions. [2025-04-26 18:41:08,854 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:08,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 310 transitions. [2025-04-26 18:41:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 310 transitions. [2025-04-26 18:41:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-04-26 18:41:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 2.074380165289256) internal successors, (in total 251), 120 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 251 transitions. [2025-04-26 18:41:08,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 18:41:08,860 INFO L438 stractBuchiCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 18:41:08,860 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:08,860 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 251 transitions. [2025-04-26 18:41:08,861 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:08,861 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:08,861 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:08,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:08,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:08,861 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L57: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L60-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L24-1-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L60-1-->L35-1: 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]" "[70] L24-->L24-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (+ (select (select v_mult_4 (select v_A_4 v_i_8)) (select v_B_4 v_i_8)) v_res1_6) v_res1_5)) InVars {A=v_A_4, i=v_i_8, res1=v_res1_6, mult=v_mult_4, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, res1=v_res1_5, mult=v_mult_4, B=v_B_4} AuxVars[] AssignedVars[res1, i]" "[87] L61-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[67] L24-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L35-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:08,861 INFO L754 eck$LassoCheckResult]: Loop: "[76] L46-1-->L46: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[78] L46-->L46-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (+ v_res2_12 (select (select v_mult_8 (select v_A_8 v_k_8)) (select v_B_8 v_k_8))) v_res2_11)) InVars {A=v_A_8, res2=v_res2_12, k=v_k_8, mult=v_mult_8, B=v_B_8} OutVars{A=v_A_8, res2=v_res2_11, k=v_k_7, mult=v_mult_8, B=v_B_8} AuxVars[] AssignedVars[k, res2]" [2025-04-26 18:41:08,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1370708583, now seen corresponding path program 1 times [2025-04-26 18:41:08,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890675024] [2025-04-26 18:41:08,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:08,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:08,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:08,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:08,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:08,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:41:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283691950] [2025-04-26 18:41:08,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:08,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:08,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:08,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:08,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1304014043, now seen corresponding path program 1 times [2025-04-26 18:41:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893388983] [2025-04-26 18:41:08,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:08,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:08,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,017 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:09,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:09,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:09,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:09,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:09,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:09,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:09,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:09,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:09,017 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:09,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,171 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:09,171 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:09,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:09,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:09,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:09,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:09,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:09,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:09,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:09,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:09,189 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:09,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:09,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,196 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:09,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:09,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:09,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:09,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:09,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:09,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:09,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:09,212 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:09,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:41:09,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,219 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:09,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:09,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:09,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:09,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:09,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:09,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:09,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:09,239 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:09,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,246 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:09,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:09,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:09,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:09,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:09,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:09,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:09,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:09,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:09,273 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:09,274 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,276 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:09,277 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:09,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:41:09,293 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:09,293 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:09,293 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:41:09,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:09,300 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:09,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:09,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:09,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:09,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:09,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:09,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:09,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:09,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:09,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:09,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:09,348 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:09,349 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:09,398 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 224 states and 442 transitions. Complement of second has 6 states. [2025-04-26 18:41:09,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:41:09,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:09,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:09,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:09,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:09,399 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:09,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:09,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 442 transitions. [2025-04-26 18:41:09,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:09,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2025-04-26 18:41:09,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:09,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:09,401 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:09,401 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:09,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:09,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:09,401 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:09,402 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:09,402 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:09,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:09,402 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:09,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:09,413 INFO L201 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:09 BoogieIcfgContainer [2025-04-26 18:41:09,413 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:09,414 INFO L158 Benchmark]: Toolchain (without parser) took 3081.28ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.8MB in the beginning and 117.2MB in the end (delta: -31.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:09,414 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:09,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.96ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:09,414 INFO L158 Benchmark]: Boogie Preprocessor took 17.87ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.9MB in the end (delta: 973.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:09,414 INFO L158 Benchmark]: RCFGBuilder took 184.37ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:09,415 INFO L158 Benchmark]: BuchiAutomizer took 2837.69ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.9MB in the beginning and 117.2MB in the end (delta: -44.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:09,415 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 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.96ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.87ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.9MB in the end (delta: 973.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 184.37ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2837.69ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.9MB in the beginning and 117.2MB in the end (delta: -44.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 60 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp75 ukn81 mio100 lsp59 div100 bol100 ite100 ukn100 eq163 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 161, Number of transitions in reduction automaton: 227, Number of states in reduction automaton: 114, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:09,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... [2025-04-26 18:41:03,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-26 18:41:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:41:03,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:03,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:03,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 18:41:03,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:03,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:03,865 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-26 18:41:03,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-04-26 18:41:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136925526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:03,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-04-26 18:41:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009210383] [2025-04-26 18:41:03,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:03,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-26 18:41:03,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2025-04-26 18:41:03,972 INFO L87 Difference]: Start difference. First operand 14020 states and 28016 transitions. cyclomatic complexity: 15386 Second operand has 25 states, 25 states have (on average 2.52) internal successors, (in total 63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:06,687 INFO L93 Difference]: Finished difference Result 31360 states and 61884 transitions. [2025-04-26 18:41:06,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31360 states and 61884 transitions. [2025-04-26 18:41:06,816 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 372 [2025-04-26 18:41:06,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31360 states to 31270 states and 61748 transitions. [2025-04-26 18:41:06,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2724 [2025-04-26 18:41:06,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2724 [2025-04-26 18:41:06,944 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31270 states and 61748 transitions. [2025-04-26 18:41:06,945 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:06,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31270 states and 61748 transitions. [2025-04-26 18:41:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31270 states and 61748 transitions. [2025-04-26 18:41:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31270 to 14975. [2025-04-26 18:41:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14975 states, 14975 states have (on average 2.0068113522537563) internal successors, (in total 30052), 14974 states have internal predecessors, (30052), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14975 states to 14975 states and 30052 transitions. [2025-04-26 18:41:07,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14975 states and 30052 transitions. [2025-04-26 18:41:07,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-26 18:41:07,253 INFO L438 stractBuchiCegarLoop]: Abstraction has 14975 states and 30052 transitions. [2025-04-26 18:41:07,253 INFO L340 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-04-26 18:41:07,253 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14975 states and 30052 transitions. [2025-04-26 18:41:07,289 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 288 [2025-04-26 18:41:07,290 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:07,290 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:07,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:07,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:07,291 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:07,291 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:07,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1285091469, now seen corresponding path program 1 times [2025-04-26 18:41:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021199057] [2025-04-26 18:41:07,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:41:07,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:07,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:07,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021199057] [2025-04-26 18:41:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021199057] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:07,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922697752] [2025-04-26 18:41:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,344 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-26 18:41:07,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:41:07,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:07,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922697752] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-26 18:41:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 7] total 13 [2025-04-26 18:41:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781646929] [2025-04-26 18:41:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:07,603 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:07,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 5 times [2025-04-26 18:41:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:07,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794233206] [2025-04-26 18:41:07,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:07,605 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:07,606 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:07,606 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:07,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:07,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:07,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:07,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:07,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 18:41:07,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-26 18:41:07,620 INFO L87 Difference]: Start difference. First operand 14975 states and 30052 transitions. cyclomatic complexity: 16554 Second operand has 8 states, 8 states have (on average 3.0) internal successors, (in total 24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:07,870 INFO L93 Difference]: Finished difference Result 18932 states and 36907 transitions. [2025-04-26 18:41:07,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18932 states and 36907 transitions. [2025-04-26 18:41:07,977 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 330 [2025-04-26 18:41:08,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18932 states to 18853 states and 36789 transitions. [2025-04-26 18:41:08,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2025-04-26 18:41:08,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2025-04-26 18:41:08,060 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18853 states and 36789 transitions. [2025-04-26 18:41:08,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:08,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18853 states and 36789 transitions. [2025-04-26 18:41:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18853 states and 36789 transitions. [2025-04-26 18:41:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18853 to 16413. [2025-04-26 18:41:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16413 states, 16413 states have (on average 2.008651678547493) internal successors, (in total 32968), 16412 states have internal predecessors, (32968), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16413 states to 16413 states and 32968 transitions. [2025-04-26 18:41:08,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16413 states and 32968 transitions. [2025-04-26 18:41:08,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 18:41:08,339 INFO L438 stractBuchiCegarLoop]: Abstraction has 16413 states and 32968 transitions. [2025-04-26 18:41:08,339 INFO L340 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-04-26 18:41:08,339 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16413 states and 32968 transitions. [2025-04-26 18:41:08,397 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 288 [2025-04-26 18:41:08,397 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:08,397 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:08,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:08,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:08,398 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:08,398 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:08,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1290578469, now seen corresponding path program 2 times [2025-04-26 18:41:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026096686] [2025-04-26 18:41:08,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 18:41:08,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:08,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:41:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:08,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026096686] [2025-04-26 18:41:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026096686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:08,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136468706] [2025-04-26 18:41:08,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:08,449 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:08,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-26 18:41:08,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 18:41:08,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:08,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:08,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:08,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:08,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 18:41:08,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 18:41:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136468706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:08,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 18:41:08,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-04-26 18:41:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27188508] [2025-04-26 18:41:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:08,537 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:08,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 6 times [2025-04-26 18:41:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:08,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097728305] [2025-04-26 18:41:08,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:08,539 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:08,540 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:08,540 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:41:08,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:08,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:08,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:08,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:08,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:08,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:08,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-26 18:41:08,555 INFO L87 Difference]: Start difference. First operand 16413 states and 32968 transitions. cyclomatic complexity: 18216 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (in total 22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:08,757 INFO L93 Difference]: Finished difference Result 21122 states and 41793 transitions. [2025-04-26 18:41:08,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21122 states and 41793 transitions. [2025-04-26 18:41:08,872 INFO L131 ngComponentsAnalysis]: Automaton has 145 accepting balls. 471 [2025-04-26 18:41:08,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21122 states to 20010 states and 39635 transitions. [2025-04-26 18:41:08,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1959 [2025-04-26 18:41:08,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1963 [2025-04-26 18:41:08,952 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20010 states and 39635 transitions. [2025-04-26 18:41:08,952 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:08,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20010 states and 39635 transitions. [2025-04-26 18:41:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states and 39635 transitions. [2025-04-26 18:41:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 18276. [2025-04-26 18:41:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18276 states, 18276 states have (on average 2.019260231998249) internal successors, (in total 36904), 18275 states have internal predecessors, (36904), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18276 states to 18276 states and 36904 transitions. [2025-04-26 18:41:09,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 18:41:09,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 18:41:09,284 INFO L438 stractBuchiCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 18:41:09,284 INFO L340 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-04-26 18:41:09,284 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18276 states and 36904 transitions. [2025-04-26 18:41:09,335 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 18:41:09,335 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,335 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:09,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:09,336 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[105] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] L69-->L51: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 18:41:09,336 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 18:41:09,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1628817585, now seen corresponding path program 3 times [2025-04-26 18:41:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514569613] [2025-04-26 18:41:09,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-26 18:41:09,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:09,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:41:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:09,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 8 times [2025-04-26 18:41:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123489261] [2025-04-26 18:41:09,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:09,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:09,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:09,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:09,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash -435710290, now seen corresponding path program 1 times [2025-04-26 18:41:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027895287] [2025-04-26 18:41:09,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:09,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:09,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:09,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:09,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027895287] [2025-04-26 18:41:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027895287] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:09,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16091913] [2025-04-26 18:41:09,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,500 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:09,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-26 18:41:09,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:09,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:09,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:09,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 18:41:09,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:09,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:09,801 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-26 18:41:09,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-04-26 18:41:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16091913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:09,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:09,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-04-26 18:41:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585957839] [2025-04-26 18:41:09,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:09,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-26 18:41:09,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-04-26 18:41:09,899 INFO L87 Difference]: Start difference. First operand 18276 states and 36904 transitions. cyclomatic complexity: 20400 Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (in total 65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:11,565 INFO L93 Difference]: Finished difference Result 23691 states and 46643 transitions. [2025-04-26 18:41:11,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23691 states and 46643 transitions. [2025-04-26 18:41:11,665 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 381 [2025-04-26 18:41:11,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23691 states to 23601 states and 46507 transitions. [2025-04-26 18:41:11,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1940 [2025-04-26 18:41:11,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1940 [2025-04-26 18:41:11,752 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23601 states and 46507 transitions. [2025-04-26 18:41:11,752 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:11,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23601 states and 46507 transitions. [2025-04-26 18:41:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23601 states and 46507 transitions. [2025-04-26 18:41:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23601 to 18276. [2025-04-26 18:41:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18276 states, 18276 states have (on average 2.019260231998249) internal successors, (in total 36904), 18275 states have internal predecessors, (36904), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18276 states to 18276 states and 36904 transitions. [2025-04-26 18:41:11,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 18:41:11,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-26 18:41:11,999 INFO L438 stractBuchiCegarLoop]: Abstraction has 18276 states and 36904 transitions. [2025-04-26 18:41:11,999 INFO L340 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-04-26 18:41:12,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18276 states and 36904 transitions. [2025-04-26 18:41:12,093 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 18:41:12,093 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:12,093 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:12,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:12,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:12,094 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:12,094 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:12,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1358570326, now seen corresponding path program 4 times [2025-04-26 18:41:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913040597] [2025-04-26 18:41:12,094 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-26 18:41:12,098 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:12,098 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:12,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:12,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:12,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 7 times [2025-04-26 18:41:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602407358] [2025-04-26 18:41:12,101 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:41:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:12,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:12,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:12,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:12,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1691867904, now seen corresponding path program 1 times [2025-04-26 18:41:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73797894] [2025-04-26 18:41:12,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:12,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:12,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:12,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73797894] [2025-04-26 18:41:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73797894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-26 18:41:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659001511] [2025-04-26 18:41:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:12,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-26 18:41:12,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-26 18:41:12,261 INFO L87 Difference]: Start difference. First operand 18276 states and 36904 transitions. cyclomatic complexity: 20400 Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (in total 28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:13,246 INFO L93 Difference]: Finished difference Result 43896 states and 86067 transitions. [2025-04-26 18:41:13,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43896 states and 86067 transitions. [2025-04-26 18:41:13,441 INFO L131 ngComponentsAnalysis]: Automaton has 280 accepting balls. 936 [2025-04-26 18:41:13,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43896 states to 41033 states and 80180 transitions. [2025-04-26 18:41:13,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3644 [2025-04-26 18:41:13,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3648 [2025-04-26 18:41:13,740 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41033 states and 80180 transitions. [2025-04-26 18:41:13,740 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:13,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41033 states and 80180 transitions. [2025-04-26 18:41:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41033 states and 80180 transitions. [2025-04-26 18:41:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41033 to 24362. [2025-04-26 18:41:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24362 states, 24362 states have (on average 2.0456038092110664) internal successors, (in total 49835), 24361 states have internal predecessors, (49835), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24362 states to 24362 states and 49835 transitions. [2025-04-26 18:41:14,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24362 states and 49835 transitions. [2025-04-26 18:41:14,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-26 18:41:14,206 INFO L438 stractBuchiCegarLoop]: Abstraction has 24362 states and 49835 transitions. [2025-04-26 18:41:14,206 INFO L340 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-04-26 18:41:14,206 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24362 states and 49835 transitions. [2025-04-26 18:41:14,294 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 18:41:14,294 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:14,294 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:14,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:14,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:14,295 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[138] L69-->L51: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 18:41:14,296 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 18:41:14,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -758813408, now seen corresponding path program 1 times [2025-04-26 18:41:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:14,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57069666] [2025-04-26 18:41:14,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:14,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:14,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:14,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57069666] [2025-04-26 18:41:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57069666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 18:41:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900574718] [2025-04-26 18:41:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:14,348 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:14,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 9 times [2025-04-26 18:41:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:14,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547053689] [2025-04-26 18:41:14,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:14,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:14,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:14,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:14,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:14,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:14,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:14,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:14,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:14,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:14,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:14,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 18:41:14,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-26 18:41:14,366 INFO L87 Difference]: Start difference. First operand 24362 states and 49835 transitions. cyclomatic complexity: 27884 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:14,651 INFO L93 Difference]: Finished difference Result 26540 states and 53644 transitions. [2025-04-26 18:41:14,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26540 states and 53644 transitions. [2025-04-26 18:41:14,796 INFO L131 ngComponentsAnalysis]: Automaton has 108 accepting balls. 360 [2025-04-26 18:41:14,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26540 states to 26536 states and 53638 transitions. [2025-04-26 18:41:14,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1965 [2025-04-26 18:41:14,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1965 [2025-04-26 18:41:14,911 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26536 states and 53638 transitions. [2025-04-26 18:41:14,911 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:14,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26536 states and 53638 transitions. [2025-04-26 18:41:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26536 states and 53638 transitions. [2025-04-26 18:41:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26536 to 24371. [2025-04-26 18:41:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24371 states, 24371 states have (on average 2.045422838619671) internal successors, (in total 49849), 24370 states have internal predecessors, (49849), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24371 states to 24371 states and 49849 transitions. [2025-04-26 18:41:15,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24371 states and 49849 transitions. [2025-04-26 18:41:15,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 18:41:15,453 INFO L438 stractBuchiCegarLoop]: Abstraction has 24371 states and 49849 transitions. [2025-04-26 18:41:15,453 INFO L340 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-04-26 18:41:15,453 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24371 states and 49849 transitions. [2025-04-26 18:41:15,514 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 339 [2025-04-26 18:41:15,514 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:15,514 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:15,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:15,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:15,515 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[112] L38-->thread2FINAL: Formula: (<= v_M_2 v_j1_7) InVars {M=v_M_2, j1=v_j1_7} OutVars{M=v_M_2, j1=v_j1_7} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[138] L69-->L51: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[125] L53-1-->L57: Formula: (<= (select v_A_6 v_k1_5) v_k2_5) InVars {A=v_A_6, k1=v_k1_5, k2=v_k2_5} OutVars{A=v_A_6, k1=v_k1_5, k2=v_k2_5} AuxVars[] AssignedVars[]" "[127] L57-->L51: Formula: (= (+ v_k1_7 1) v_k1_6) InVars {k1=v_k1_7} OutVars{k1=v_k1_6} AuxVars[] AssignedVars[k1]" "[122] L51-->L52: Formula: (< v_k1_2 v_N_4) InVars {k1=v_k1_2, N=v_N_4} OutVars{k1=v_k1_2, N=v_N_4} AuxVars[] AssignedVars[]" "[124] L52-->L53-1: Formula: (= v_k2_1 0) InVars {} OutVars{k2=v_k2_1} AuxVars[] AssignedVars[k2]" [2025-04-26 18:41:15,515 INFO L754 eck$LassoCheckResult]: Loop: "[126] L53-1-->L54: Formula: (< v_k2_2 (select v_A_5 v_k1_3)) InVars {A=v_A_5, k1=v_k1_3, k2=v_k2_2} OutVars{A=v_A_5, k1=v_k1_3, k2=v_k2_2} AuxVars[] AssignedVars[]" "[128] L54-->L55: Formula: (= (+ (select v_B_3 v_k1_4) v_res2_6) v_res2_5) InVars {res2=v_res2_6, k1=v_k1_4, B=v_B_3} OutVars{res2=v_res2_5, k1=v_k1_4, B=v_B_3} AuxVars[] AssignedVars[res2]" "[129] L55-->L53-1: Formula: (= v_k2_3 (+ v_k2_4 1)) InVars {k2=v_k2_4} OutVars{k2=v_k2_3} AuxVars[] AssignedVars[k2]" [2025-04-26 18:41:15,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash 165998037, now seen corresponding path program 2 times [2025-04-26 18:41:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:15,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092751023] [2025-04-26 18:41:15,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:15,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 18:41:15,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:15,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:15,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:15,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:41:15,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:15,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:15,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:15,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:15,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 10 times [2025-04-26 18:41:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:15,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802581947] [2025-04-26 18:41:15,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:15,525 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 18:41:15,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:15,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:15,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:15,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:15,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:15,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:15,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:15,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:15,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1740287754, now seen corresponding path program 1 times [2025-04-26 18:41:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:15,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282148375] [2025-04-26 18:41:15,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:15,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:41:15,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:41:15,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:15,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:15,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:15,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:41:15,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:41:15,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:15,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:15,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:15,697 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:15,697 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:15,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:15,697 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:15,697 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:15,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:15,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:15,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration24_Lasso [2025-04-26 18:41:15,697 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:15,697 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:15,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:15,846 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:15,846 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:15,848 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:15,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 18:41:15,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:15,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:15,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:15,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:15,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:15,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:15,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:15,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:15,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 18:41:15,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:15,870 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:15,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 18:41:15,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:15,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:15,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:15,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:15,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:15,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:15,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:15,883 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:15,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:15,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:15,891 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:15,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 18:41:15,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:15,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:15,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:15,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:15,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:15,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:15,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:15,908 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:15,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 18:41:15,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:15,914 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:15,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 18:41:15,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:15,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:15,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:15,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:15,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:15,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:15,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:15,931 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:15,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:15,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:15,937 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:15,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 18:41:15,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:15,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:15,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:15,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:15,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:15,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:15,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:15,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:15,963 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:15,963 INFO L437 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 18:41:15,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:15,965 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:15,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 18:41:15,966 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:15,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 18:41:15,981 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:15,981 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:15,981 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k2, v_rep(select A k1)_5) = -1*k2 + 1*v_rep(select A k1)_5 Supporting invariants [] [2025-04-26 18:41:15,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 18:41:15,988 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:15,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:15,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:41:16,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:16,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:16,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:16,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:16,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:16,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:16,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:16,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:16,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:16,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:16,031 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:16,031 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:16,407 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 42505 states and 86068 transitions. Complement of second has 7 states. [2025-04-26 18:41:16,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 18:41:16,408 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 18:41:16,408 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:16,408 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:16,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:16,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:41:16,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:16,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:16,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:16,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:16,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:16,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:16,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:16,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:16,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:16,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:16,453 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:16,453 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:16,649 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 42505 states and 86068 transitions. Complement of second has 7 states. [2025-04-26 18:41:16,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 18:41:16,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 18:41:16,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:16,650 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:16,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:16,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:41:16,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:16,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:16,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:16,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:16,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:16,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:16,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:16,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:16,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:16,695 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:16,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:16,705 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:16,705 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:16,899 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24371 states and 49849 transitions. cyclomatic complexity: 27891. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 42219 states and 87568 transitions. Complement of second has 6 states. [2025-04-26 18:41:16,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-04-26 18:41:16,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 18:41:16,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:16,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 29 letters. Loop has 3 letters. [2025-04-26 18:41:16,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:16,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 26 letters. Loop has 6 letters. [2025-04-26 18:41:16,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:16,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42219 states and 87568 transitions. [2025-04-26 18:41:17,208 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 318 [2025-04-26 18:41:17,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42219 states to 23733 states and 46905 transitions. [2025-04-26 18:41:17,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1548 [2025-04-26 18:41:17,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1621 [2025-04-26 18:41:17,297 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23733 states and 46905 transitions. [2025-04-26 18:41:17,297 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:17,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23733 states and 46905 transitions. [2025-04-26 18:41:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23733 states and 46905 transitions. [2025-04-26 18:41:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23733 to 12819. [2025-04-26 18:41:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12819 states, 12819 states have (on average 1.992979171542242) internal successors, (in total 25548), 12818 states have internal predecessors, (25548), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12819 states to 12819 states and 25548 transitions. [2025-04-26 18:41:17,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12819 states and 25548 transitions. [2025-04-26 18:41:17,482 INFO L438 stractBuchiCegarLoop]: Abstraction has 12819 states and 25548 transitions. [2025-04-26 18:41:17,482 INFO L340 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-04-26 18:41:17,482 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12819 states and 25548 transitions. [2025-04-26 18:41:17,511 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 18:41:17,511 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:17,511 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:17,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:17,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:17,512 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:17,512 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:17,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1210505774, now seen corresponding path program 3 times [2025-04-26 18:41:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:17,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700088820] [2025-04-26 18:41:17,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:17,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-26 18:41:17,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:41:17,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:41:17,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:17,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:17,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700088820] [2025-04-26 18:41:17,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700088820] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:17,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332779999] [2025-04-26 18:41:17,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:17,556 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:17,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-26 18:41:17,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-26 18:41:17,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:41:17,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:41:17,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:17,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:17,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:17,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332779999] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:17,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-26 18:41:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922566592] [2025-04-26 18:41:17,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:17,708 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:17,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 8 times [2025-04-26 18:41:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:17,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679636796] [2025-04-26 18:41:17,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:17,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:17,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:17,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:17,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:17,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:17,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:17,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:17,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:17,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:17,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 18:41:17,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-26 18:41:17,724 INFO L87 Difference]: Start difference. First operand 12819 states and 25548 transitions. cyclomatic complexity: 13890 Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (in total 55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:17,929 INFO L93 Difference]: Finished difference Result 15422 states and 30331 transitions. [2025-04-26 18:41:17,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15422 states and 30331 transitions. [2025-04-26 18:41:17,987 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 18:41:18,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15422 states to 15338 states and 30216 transitions. [2025-04-26 18:41:18,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 813 [2025-04-26 18:41:18,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 813 [2025-04-26 18:41:18,039 INFO L74 IsDeterministic]: Start isDeterministic. Operand 15338 states and 30216 transitions. [2025-04-26 18:41:18,039 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:18,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15338 states and 30216 transitions. [2025-04-26 18:41:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15338 states and 30216 transitions. [2025-04-26 18:41:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15338 to 13645. [2025-04-26 18:41:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13645 states, 13645 states have (on average 1.9794796628801758) internal successors, (in total 27010), 13644 states have internal predecessors, (27010), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13645 states to 13645 states and 27010 transitions. [2025-04-26 18:41:18,299 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13645 states and 27010 transitions. [2025-04-26 18:41:18,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 18:41:18,300 INFO L438 stractBuchiCegarLoop]: Abstraction has 13645 states and 27010 transitions. [2025-04-26 18:41:18,300 INFO L340 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-04-26 18:41:18,300 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13645 states and 27010 transitions. [2025-04-26 18:41:18,346 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 18:41:18,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:18,347 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:18,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:18,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:18,348 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[135] L68-1-->L38: 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]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:18,348 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:18,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash 150624626, now seen corresponding path program 4 times [2025-04-26 18:41:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:18,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471488429] [2025-04-26 18:41:18,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:18,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-26 18:41:18,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:41:18,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 18:41:18,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:18,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:18,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471488429] [2025-04-26 18:41:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471488429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:18,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973743929] [2025-04-26 18:41:18,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:18,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:18,417 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:18,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-26 18:41:18,437 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-26 18:41:18,442 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:41:18,442 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-26 18:41:18,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:18,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:18,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:41:18,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973743929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:18,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2025-04-26 18:41:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564006255] [2025-04-26 18:41:18,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:18,624 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:18,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 9 times [2025-04-26 18:41:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:18,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816934724] [2025-04-26 18:41:18,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:18,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:18,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:18,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:18,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:18,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:18,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:18,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:18,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:18,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:18,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-26 18:41:18,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-04-26 18:41:18,643 INFO L87 Difference]: Start difference. First operand 13645 states and 27010 transitions. cyclomatic complexity: 14553 Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (in total 65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:18,867 INFO L93 Difference]: Finished difference Result 21480 states and 41633 transitions. [2025-04-26 18:41:18,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21480 states and 41633 transitions. [2025-04-26 18:41:18,975 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 468 [2025-04-26 18:41:19,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21480 states to 19677 states and 38162 transitions. [2025-04-26 18:41:19,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1556 [2025-04-26 18:41:19,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1566 [2025-04-26 18:41:19,051 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19677 states and 38162 transitions. [2025-04-26 18:41:19,051 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:19,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19677 states and 38162 transitions. [2025-04-26 18:41:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19677 states and 38162 transitions. [2025-04-26 18:41:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19677 to 14678. [2025-04-26 18:41:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14678 states, 14678 states have (on average 1.9841940318844529) internal successors, (in total 29124), 14677 states have internal predecessors, (29124), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14678 states to 14678 states and 29124 transitions. [2025-04-26 18:41:19,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14678 states and 29124 transitions. [2025-04-26 18:41:19,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 18:41:19,291 INFO L438 stractBuchiCegarLoop]: Abstraction has 14678 states and 29124 transitions. [2025-04-26 18:41:19,291 INFO L340 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-04-26 18:41:19,291 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14678 states and 29124 transitions. [2025-04-26 18:41:19,341 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 18:41:19,341 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:19,341 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:19,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:19,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:19,342 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:19,342 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:19,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -85097311, now seen corresponding path program 5 times [2025-04-26 18:41:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:19,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206095034] [2025-04-26 18:41:19,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:19,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 18:41:19,346 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:19,346 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:19,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:19,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:19,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:19,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:19,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:19,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:19,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 10 times [2025-04-26 18:41:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:19,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007566835] [2025-04-26 18:41:19,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:19,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 18:41:19,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:19,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:19,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:19,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:19,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:19,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:19,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:19,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:19,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:19,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1103171115, now seen corresponding path program 1 times [2025-04-26 18:41:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:19,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49557819] [2025-04-26 18:41:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:41:19,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:19,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:19,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:19,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49557819] [2025-04-26 18:41:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49557819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:19,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526978222] [2025-04-26 18:41:19,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:19,526 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:19,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-26 18:41:19,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:41:19,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:19,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:19,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:19,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 18:41:19,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:19,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:19,665 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-26 18:41:19,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-04-26 18:41:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:19,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526978222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:19,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:19,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2025-04-26 18:41:19,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621387931] [2025-04-26 18:41:19,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:19,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:19,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-26 18:41:19,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-26 18:41:19,710 INFO L87 Difference]: Start difference. First operand 14678 states and 29124 transitions. cyclomatic complexity: 15681 Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (in total 61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:20,428 INFO L93 Difference]: Finished difference Result 33718 states and 64551 transitions. [2025-04-26 18:41:20,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33718 states and 64551 transitions. [2025-04-26 18:41:20,566 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 390 [2025-04-26 18:41:20,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33718 states to 31955 states and 60601 transitions. [2025-04-26 18:41:20,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2248 [2025-04-26 18:41:20,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2250 [2025-04-26 18:41:20,693 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31955 states and 60601 transitions. [2025-04-26 18:41:20,693 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:20,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31955 states and 60601 transitions. [2025-04-26 18:41:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31955 states and 60601 transitions. [2025-04-26 18:41:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31955 to 21625. [2025-04-26 18:41:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21625 states, 21625 states have (on average 1.976) internal successors, (in total 42731), 21624 states have internal predecessors, (42731), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21625 states to 21625 states and 42731 transitions. [2025-04-26 18:41:21,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21625 states and 42731 transitions. [2025-04-26 18:41:21,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-26 18:41:21,026 INFO L438 stractBuchiCegarLoop]: Abstraction has 21625 states and 42731 transitions. [2025-04-26 18:41:21,026 INFO L340 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-04-26 18:41:21,026 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21625 states and 42731 transitions. [2025-04-26 18:41:21,104 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 18:41:21,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:21,104 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:21,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:21,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:21,105 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:21,105 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:21,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2096861993, now seen corresponding path program 6 times [2025-04-26 18:41:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926415592] [2025-04-26 18:41:21,106 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,108 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-26 18:41:21,110 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:21,110 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 18:41:21,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:21,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:21,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 11 times [2025-04-26 18:41:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017401488] [2025-04-26 18:41:21,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:21,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:21,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:21,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:21,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:21,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1611164193, now seen corresponding path program 2 times [2025-04-26 18:41:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959461635] [2025-04-26 18:41:21,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-26 18:41:21,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:21,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:21,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:41:21,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:21,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,296 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:21,296 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:21,296 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:21,296 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:21,296 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:21,296 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,296 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:21,296 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:21,296 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration28_Lasso [2025-04-26 18:41:21,296 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:21,296 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:21,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,441 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:21,441 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:21,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:21,443 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:21,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 18:41:21,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:21,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:21,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:21,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:21,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:21,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:21,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:21,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:21,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:21,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:21,466 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:21,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 18:41:21,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:21,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:21,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:21,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:21,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:21,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:21,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:21,481 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:21,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 18:41:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:21,489 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 18:41:21,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:21,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:21,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:21,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:21,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:21,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:21,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:21,504 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:21,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 18:41:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:21,512 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:21,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 18:41:21,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:21,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:21,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:21,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:21,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:21,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:21,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:21,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:21,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:21,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:21,540 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 18:41:21,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:21,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:21,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:21,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:21,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:21,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:21,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:21,563 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:21,570 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:41:21,570 INFO L437 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:21,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:21,572 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:21,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 18:41:21,573 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:21,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 18:41:21,589 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:41:21,590 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:21,590 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j2) = -2*j2 + 1 Supporting invariants [-1*v_rep(select A 1)_5 + 1 >= 0] [2025-04-26 18:41:21,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:21,603 INFO L156 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 18:41:21,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:21,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:21,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:21,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 18:41:21,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:21,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:21,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:21,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:21,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:21,815 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-04-26 18:41:21,815 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851 Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,990 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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 22915 states and 45010 transitions. Complement of second has 6 states. [2025-04-26 18:41:21,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 18:41:21,991 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:41:21,991 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:21,991 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:22,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:22,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:22,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:22,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,177 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:22,197 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-04-26 18:41:22,197 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851 Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,365 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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 22915 states and 45010 transitions. Complement of second has 6 states. [2025-04-26 18:41:22,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 18:41:22,366 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:41:22,366 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,366 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:22,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:22,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:22,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:22,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,604 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:22,621 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-04-26 18:41:22,621 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851 Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,946 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21625 states and 42731 transitions. cyclomatic complexity: 22851. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 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 39393 states and 78722 transitions. Complement of second has 21 states. [2025-04-26 18:41:22,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 18:41:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (in total 30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2025-04-26 18:41:22,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 251 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:41:22,947 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 251 transitions. Stem has 31 letters. Loop has 3 letters. [2025-04-26 18:41:22,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 251 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 18:41:22,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39393 states and 78722 transitions. [2025-04-26 18:41:23,125 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 300 [2025-04-26 18:41:23,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39393 states to 34851 states and 69029 transitions. [2025-04-26 18:41:23,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2081 [2025-04-26 18:41:23,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2192 [2025-04-26 18:41:23,263 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34851 states and 69029 transitions. [2025-04-26 18:41:23,263 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:23,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34851 states and 69029 transitions. [2025-04-26 18:41:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34851 states and 69029 transitions. [2025-04-26 18:41:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34851 to 23105. [2025-04-26 18:41:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23105 states, 23105 states have (on average 1.9897424799826877) internal successors, (in total 45973), 23104 states have internal predecessors, (45973), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23105 states to 23105 states and 45973 transitions. [2025-04-26 18:41:23,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23105 states and 45973 transitions. [2025-04-26 18:41:23,581 INFO L438 stractBuchiCegarLoop]: Abstraction has 23105 states and 45973 transitions. [2025-04-26 18:41:23,581 INFO L340 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-04-26 18:41:23,581 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23105 states and 45973 transitions. [2025-04-26 18:41:23,643 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 156 [2025-04-26 18:41:23,644 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:23,644 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:23,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:23,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:23,644 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L65: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[100] L65-->L66: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L66-->L67: Formula: (and (= v_i1_8 v_res1_3) (= v_i1_8 0) (= v_i1_8 v_j1_8) (= v_i1_8 v_res2_3)) InVars {i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} OutVars{i1=v_i1_8, res2=v_res2_3, j1=v_j1_8, res1=v_res1_3} AuxVars[] AssignedVars[]" "[76] L67-->L68: Formula: (= v_k1_1 v_M_5) InVars {M=v_M_5, k1=v_k1_1} OutVars{M=v_M_5, k1=v_k1_1} AuxVars[] AssignedVars[]" "[132] L68-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[135] L68-1-->L38: 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]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[108] L27-1-->L28: Formula: (< v_i2_2 (select v_A_1 v_i1_2)) InVars {A=v_A_1, i1=v_i1_2, i2=v_i2_2} OutVars{A=v_A_1, i1=v_i1_2, i2=v_i2_2} AuxVars[] AssignedVars[]" "[110] L28-->L29: Formula: (= (+ (select v_B_1 v_i1_3) v_res1_2) v_res1_1) InVars {i1=v_i1_3, res1=v_res1_2, B=v_B_1} OutVars{i1=v_i1_3, res1=v_res1_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" "[116] L40-1-->L44: Formula: (<= (select v_A_4 v_j1_4) v_j2_5) InVars {A=v_A_4, j2=v_j2_5, j1=v_j1_4} OutVars{A=v_A_4, j2=v_j2_5, j1=v_j1_4} AuxVars[] AssignedVars[]" "[111] L29-->L27-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[118] L44-->L38: Formula: (= (+ v_j1_6 1) v_j1_5) InVars {j1=v_j1_6} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[j1]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[104] L25-->L26: Formula: (< v_i1_1 v_N_1) InVars {i1=v_i1_1, N=v_N_1} OutVars{i1=v_i1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[106] L26-->L27-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2]" "[113] L38-->L39: Formula: (< v_j1_1 v_M_1) InVars {M=v_M_1, j1=v_j1_1} OutVars{M=v_M_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[107] L27-1-->L31: Formula: (<= (select v_A_2 v_i1_4) v_i2_5) InVars {A=v_A_2, i1=v_i1_4, i2=v_i2_5} OutVars{A=v_A_2, i1=v_i1_4, i2=v_i2_5} AuxVars[] AssignedVars[]" "[109] L31-->L25: Formula: (= v_i1_5 (+ v_i1_6 1)) InVars {i1=v_i1_6} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1]" "[103] L25-->thread1FINAL: Formula: (<= v_N_2 v_i1_7) InVars {i1=v_i1_7, N=v_N_2} OutVars{i1=v_i1_7, N=v_N_2} AuxVars[] AssignedVars[]" "[115] L39-->L40-1: Formula: (= v_j2_1 0) InVars {} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:23,644 INFO L754 eck$LassoCheckResult]: Loop: "[117] L40-1-->L41: Formula: (< v_j2_2 (select v_A_3 v_j1_2)) InVars {A=v_A_3, j2=v_j2_2, j1=v_j1_2} OutVars{A=v_A_3, j2=v_j2_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[119] L41-->L42: Formula: (= (+ (select v_B_2 v_j1_3) v_res2_2) v_res2_1) InVars {res2=v_res2_2, j1=v_j1_3, B=v_B_2} OutVars{res2=v_res2_1, j1=v_j1_3, B=v_B_2} AuxVars[] AssignedVars[res2]" "[120] L42-->L40-1: Formula: (= v_j2_3 (+ v_j2_4 1)) InVars {j2=v_j2_4} OutVars{j2=v_j2_3} AuxVars[] AssignedVars[j2]" [2025-04-26 18:41:23,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1342404439, now seen corresponding path program 7 times [2025-04-26 18:41:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176271578] [2025-04-26 18:41:23,645 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:41:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:23,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:23,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:23,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:23,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash 146037, now seen corresponding path program 12 times [2025-04-26 18:41:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36835127] [2025-04-26 18:41:23,651 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:23,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,652 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:23,652 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:23,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:41:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:23,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:23,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1130265439, now seen corresponding path program 3 times [2025-04-26 18:41:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833680509] [2025-04-26 18:41:23,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-26 18:41:23,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:23,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:41:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:41:23,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:23,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,834 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:23,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:23,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:23,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:23,834 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:23,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:23,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:23,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product.wvr.bpl_petrified1_Iteration29_Lasso [2025-04-26 18:41:23,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:23,835 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:23,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,961 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:23,961 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,966 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:23,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 18:41:23,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:23,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,982 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,989 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:23,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 18:41:23,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,004 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,012 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 18:41:24,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:24,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:24,040 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:41:24,040 INFO L437 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:41:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,042 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:24,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 18:41:24,044 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:24,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 18:41:24,058 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:24,058 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:24,058 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j2, v_rep(select A j1)_4) = -1*j2 + 1*v_rep(select A j1)_4 Supporting invariants [] [2025-04-26 18:41:24,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 18:41:24,068 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 18:41:24,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:24,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:24,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:24,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:24,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:24,120 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:24,120 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,281 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 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 37630 states and 74229 transitions. Complement of second has 7 states. [2025-04-26 18:41:24,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-26 18:41:24,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:41:24,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,282 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:24,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:24,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:24,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:24,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:24,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:24,328 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:24,328 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,470 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 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 37630 states and 74229 transitions. Complement of second has 7 states. [2025-04-26 18:41:24,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-26 18:41:24,471 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:41:24,471 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,471 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:24,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:24,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:24,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:24,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:24,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:24,512 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:24,512 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,739 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23105 states and 45973 transitions. cyclomatic complexity: 24730. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 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 42293 states and 86298 transitions. Complement of second has 6 states. [2025-04-26 18:41:24,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 18:41:24,740 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:41:24,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,740 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 31 letters. Loop has 3 letters. [2025-04-26 18:41:24,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,740 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 18:41:24,740 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42293 states and 86298 transitions. [2025-04-26 18:41:24,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:24,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42293 states to 0 states and 0 transitions. [2025-04-26 18:41:24,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:24,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:24,994 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:24,994 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:24,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:24,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:24,994 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:24,994 INFO L340 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-04-26 18:41:24,994 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:24,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:24,994 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:25,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:25,006 INFO L201 PluginConnector]: Adding new model dot-product.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:25 BoogieIcfgContainer [2025-04-26 18:41:25,006 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:25,006 INFO L158 Benchmark]: Toolchain (without parser) took 34819.05ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 77.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-04-26 18:41:25,007 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.18ms. Allocated memory is still 142.6MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:25,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.62ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 75.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:25,007 INFO L158 Benchmark]: Boogie Preprocessor took 27.97ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 74.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:25,007 INFO L158 Benchmark]: RCFGBuilder took 216.10ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 64.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:25,007 INFO L158 Benchmark]: BuchiAutomizer took 34530.02ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 64.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-04-26 18:41:25,008 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 1.18ms. Allocated memory is still 142.6MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.62ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 75.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.97ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 74.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 216.10ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 64.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 34530.02ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 64.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.4s and 30 iterations. TraceHistogramMax:3. Analysis of lassos took 10.1s. Construction of modules took 4.2s. Büchi inclusion checks took 15.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 28. Automata minimization 4.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 106197 StatesRemovedByMinimization, 28 NontrivialMinimizations. Non-live state removal took 4.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8917 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8901 mSDsluCounter, 7731 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5740 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10528 IncrementalHoareTripleChecker+Invalid, 10864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 1991 mSDtfsCounter, 10528 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc8 concLT0 SILN0 SILU9 SILI0 SILT0 lasso12 LassoPreprocessingBenchmarks: Lassos: inital75 mio100 ax100 hnf100 lsp61 ukn103 mio100 lsp54 div100 bol100 ite100 ukn100 eq181 hnf90 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 363, Number of transitions in reduction automaton: 1213, Number of states in reduction automaton: 666, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 29 terminating modules (17 trivial, 8 deterministic, 4 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + A[i1] and consists of 4 locations. One deterministic module has affine ranking function N + -1 * k1 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M and consists of 4 locations. One deterministic module has affine ranking function A[0] + -1 * k2 and consists of 12 locations. One deterministic module has affine ranking function A[j1] + -1 * j2 and consists of 4 locations. One deterministic module has affine ranking function A[k1] + -1 * k2 and consists of 4 locations. One deterministic module has affine ranking function A[k1] + -1 * k2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i2 + A[i1] and consists of 4 locations. One nondeterministic module has affine ranking function A[k1] + -1 * k2 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j2 + 1 and consists of 13 locations. One nondeterministic module has affine ranking function A[j1] + -1 * j2 and consists of 4 locations. 17 modules have a trivial ranking function, the largest among these consists of 25 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:25,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-26 18:41:25,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-26 18:41:25,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:25,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-26 18:41:25,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-26 18:41:26,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,422 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...