/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/min-array-hom.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:39,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:39,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:39,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:39,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:39,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:39,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:39,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:39,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:39,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:39,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:39,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:39,249 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:39,249 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:39,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:39,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:39,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:39,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:39,251 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:39,252 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:39,252 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:39,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:39,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:39,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:39,492 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:39,493 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:39,496 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/min-array-hom.wvr.bpl [2025-04-26 16:55:39,497 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array-hom.wvr.bpl' [2025-04-26 16:55:39,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:39,519 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:39,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:39,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:39,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:39,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,558 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:39,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:39,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:39,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:39,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:39,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:39,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:39,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:39,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:39,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/1) ... [2025-04-26 16:55:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:39,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:39,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:55:39,634 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:39,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:39,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:39,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:39,636 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:55:39,673 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:39,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:39,758 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:39,759 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:39,775 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:39,776 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:39,776 INFO L201 PluginConnector]: Adding new model min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:39 BoogieIcfgContainer [2025-04-26 16:55:39,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:39,777 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:39,777 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:39,781 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:39,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:39,782 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:39" (1/2) ... [2025-04-26 16:55:39,783 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1209446f and model type min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:39, skipping insertion in model container [2025-04-26 16:55:39,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:39,783 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:39" (2/2) ... [2025-04-26 16:55:39,784 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-array-hom.wvr.bpl [2025-04-26 16:55:39,823 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:39,864 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:39,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:39,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:39,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:39,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:55:39,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:55:39,944 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:55:39,946 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:39,950 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 4. Compared 28 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 16:55:39,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:55:39,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 16:55:39,954 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 16:55:39,960 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:40,060 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 16:55:40,060 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:40,060 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 16:55:40,060 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:55:40,060 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 16:55:40,060 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 16:55:40,060 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:55:40,060 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:40,066 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 16:55:40,072 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:40,073 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:40,073 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:40,073 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:40,073 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:40,073 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:40,073 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:40,073 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:40,076 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 16:55:40,093 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:40,093 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:40,093 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:40,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:40,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:40,097 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:40,099 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 16:55:40,101 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:40,101 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:40,101 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:40,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:40,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:40,108 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: 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] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_min3_1) (= v_i_6 v_min2_3) (= v_i_6 v_min1_3)) InVars {min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} OutVars{min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: 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] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:40,109 INFO L754 eck$LassoCheckResult]: Loop: "[68] L23-1-->L23: 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] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_min1_5 (let ((.cse0 (select v_A_4 v_i_8))) (ite (< .cse0 v_min1_6) .cse0 v_min1_6)))) InVars {A=v_A_4, i=v_i_8, min1=v_min1_6} OutVars{A=v_A_4, i=v_i_7, min1=v_min1_5} AuxVars[] AssignedVars[min1, i]" [2025-04-26 16:55:40,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 86396430, now seen corresponding path program 1 times [2025-04-26 16:55:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:40,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946541431] [2025-04-26 16:55:40,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:40,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:40,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:40,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:40,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:40,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:40,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:40,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:55:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:40,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945313911] [2025-04-26 16:55:40,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:40,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:40,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:40,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:40,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:40,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:40,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:40,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1422592784, now seen corresponding path program 1 times [2025-04-26 16:55:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:40,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080378491] [2025-04-26 16:55:40,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:40,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:40,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:40,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:40,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:40,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:40,503 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:40,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:40,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:40,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:40,503 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:40,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,504 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:40,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:40,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-array-hom.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:40,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:40,504 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:40,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,710 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:40,713 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:40,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:55:40,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:40,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:40,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:40,729 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:55:40,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:40,739 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:55:40,740 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:55:40,755 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:40,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:55:40,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:40,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:55:40,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:40,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:40,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:40,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:40,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:40,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:40,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:40,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:40,812 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:55:40,812 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:55:40,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:40,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:55:40,819 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:40,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:40,837 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:40,837 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:40,837 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:40,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:55:40,846 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:40,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:40,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:40,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:40,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:40,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:40,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:40,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:40,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:40,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:40,925 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:40,926 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 16:55:41,002 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 16:55:41,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:41,006 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 16:55:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-26 16:55:41,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:55:41,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:41,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:41,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:41,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:55:41,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:41,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 529 transitions. [2025-04-26 16:55:41,016 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:41,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 119 states and 241 transitions. [2025-04-26 16:55:41,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 16:55:41,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 16:55:41,020 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 241 transitions. [2025-04-26 16:55:41,020 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:41,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 241 transitions. [2025-04-26 16:55:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 241 transitions. [2025-04-26 16:55:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2025-04-26 16:55:41,041 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 16:55:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2025-04-26 16:55:41,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 16:55:41,042 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 16:55:41,042 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:41,042 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 210 transitions. [2025-04-26 16:55:41,044 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:41,044 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:41,044 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:41,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:41,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:41,044 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: 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] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_min3_1) (= v_i_6 v_min2_3) (= v_i_6 v_min1_3)) InVars {min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} OutVars{min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: 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] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L23-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] L59-1-->L34-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 16:55:41,045 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: 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] L34-->L34-1: Formula: (and (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< .cse0 v_min2_6) .cse0 v_min2_6)) v_min2_5) (= (+ v_j_8 1) v_j_7)) InVars {min2=v_min2_6, A=v_A_6, j=v_j_8} OutVars{min2=v_min2_5, A=v_A_6, j=v_j_7} AuxVars[] AssignedVars[min2, j]" [2025-04-26 16:55:41,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1150702436, now seen corresponding path program 1 times [2025-04-26 16:55:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034157130] [2025-04-26 16:55:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:41,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:41,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:41,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034157130] [2025-04-26 16:55:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034157130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251580184] [2025-04-26 16:55:41,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:41,133 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:41,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:55:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266897759] [2025-04-26 16:55:41,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:41,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:41,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:41,184 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 16:55:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:41,223 INFO L93 Difference]: Finished difference Result 106 states and 212 transitions. [2025-04-26 16:55:41,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 212 transitions. [2025-04-26 16:55:41,225 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:41,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 16:55:41,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 16:55:41,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 16:55:41,226 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 212 transitions. [2025-04-26 16:55:41,226 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:41,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 16:55:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 212 transitions. [2025-04-26 16:55:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-26 16:55:41,233 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 16:55:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 209 transitions. [2025-04-26 16:55:41,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 16:55:41,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:55:41,237 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 16:55:41,237 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:41,237 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 209 transitions. [2025-04-26 16:55:41,238 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:41,238 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:41,238 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:41,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:41,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:41,239 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: 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] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_min3_1) (= v_i_6 v_min2_3) (= v_i_6 v_min1_3)) InVars {min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} OutVars{min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: 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] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-1-->L23: 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] L59-1-->L34-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] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_min1_5 (let ((.cse0 (select v_A_4 v_i_8))) (ite (< .cse0 v_min1_6) .cse0 v_min1_6)))) InVars {A=v_A_4, i=v_i_8, min1=v_min1_6} OutVars{A=v_A_4, i=v_i_7, min1=v_min1_5} AuxVars[] AssignedVars[min1, i]" "[67] L23-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 16:55:41,239 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: 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] L34-->L34-1: Formula: (and (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< .cse0 v_min2_6) .cse0 v_min2_6)) v_min2_5) (= (+ v_j_8 1) v_j_7)) InVars {min2=v_min2_6, A=v_A_6, j=v_j_8} OutVars{min2=v_min2_5, A=v_A_6, j=v_j_7} AuxVars[] AssignedVars[min2, j]" [2025-04-26 16:55:41,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1312080987, now seen corresponding path program 1 times [2025-04-26 16:55:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771651025] [2025-04-26 16:55:41,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:41,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:41,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:41,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 2 times [2025-04-26 16:55:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298855380] [2025-04-26 16:55:41,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:41,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1810554211, now seen corresponding path program 1 times [2025-04-26 16:55:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133783452] [2025-04-26 16:55:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:41,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133783452] [2025-04-26 16:55:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133783452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:55:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560865597] [2025-04-26 16:55:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:41,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:41,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:41,403 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 16:55:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:41,514 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2025-04-26 16:55:41,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 290 transitions. [2025-04-26 16:55:41,515 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 16:55:41,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 152 states and 288 transitions. [2025-04-26 16:55:41,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 16:55:41,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 16:55:41,516 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 288 transitions. [2025-04-26 16:55:41,517 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:41,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 288 transitions. [2025-04-26 16:55:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 288 transitions. [2025-04-26 16:55:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-04-26 16:55:41,520 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 16:55:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 244 transitions. [2025-04-26 16:55:41,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 16:55:41,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:41,528 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 16:55:41,528 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:41,528 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 244 transitions. [2025-04-26 16:55:41,529 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:41,529 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:41,529 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:41,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:41,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:41,530 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: 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] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_min3_1) (= v_i_6 v_min2_3) (= v_i_6 v_min1_3)) InVars {min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} OutVars{min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: 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] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-1-->L23: 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] L59-1-->L34-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] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_min1_5 (let ((.cse0 (select v_A_4 v_i_8))) (ite (< .cse0 v_min1_6) .cse0 v_min1_6)))) InVars {A=v_A_4, i=v_i_8, min1=v_min1_6} OutVars{A=v_A_4, i=v_i_7, min1=v_min1_5} AuxVars[] AssignedVars[min1, i]" "[68] L23-1-->L23: 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] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_min1_5 (let ((.cse0 (select v_A_4 v_i_8))) (ite (< .cse0 v_min1_6) .cse0 v_min1_6)))) InVars {A=v_A_4, i=v_i_8, min1=v_min1_6} OutVars{A=v_A_4, i=v_i_7, min1=v_min1_5} AuxVars[] AssignedVars[min1, i]" "[67] L23-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 16:55:41,530 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: 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] L34-->L34-1: Formula: (and (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< .cse0 v_min2_6) .cse0 v_min2_6)) v_min2_5) (= (+ v_j_8 1) v_j_7)) InVars {min2=v_min2_6, A=v_A_6, j=v_j_8} OutVars{min2=v_min2_5, A=v_A_6, j=v_j_7} AuxVars[] AssignedVars[min2, j]" [2025-04-26 16:55:41,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1810553319, now seen corresponding path program 2 times [2025-04-26 16:55:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716296980] [2025-04-26 16:55:41,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:55:41,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:41,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:41,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:41,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 3 times [2025-04-26 16:55:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794034608] [2025-04-26 16:55:41,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:41,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -479982373, now seen corresponding path program 2 times [2025-04-26 16:55:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:41,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583833553] [2025-04-26 16:55:41,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:41,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 16:55:41,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:41,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:41,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:41,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:41,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:41,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:41,893 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:41,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:41,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:41,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:41,893 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:41,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:41,894 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:41,894 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:41,894 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-array-hom.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:41,894 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:41,894 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:41,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:41,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,355 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:42,355 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:42,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:42,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:55:42,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:42,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:42,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:42,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:42,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:42,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:42,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:42,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:42,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:55:42,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:42,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:42,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:55:42,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:42,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:42,395 INFO L203 nArgumentSynthesizer]: 5 stem disjuncts [2025-04-26 16:55:42,395 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:55:42,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:42,411 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2025-04-26 16:55:42,411 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:55:42,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:42,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:55:42,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:42,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:42,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:42,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:55:42,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:42,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:42,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:42,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:42,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:42,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:42,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:42,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:42,463 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:55:42,463 INFO L437 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:55:42,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:42,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:55:42,467 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:42,482 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 16:55:42,483 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:42,483 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:42,483 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:55:42,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:42,494 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:42,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:42,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:42,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:42,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:42,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:42,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:42,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:42,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:42,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:42,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:42,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:42,540 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:42,540 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 16:55:42,591 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 16:55:42,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:42,592 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 16:55:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:55:42,592 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:42,592 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:42,592 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:42,592 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:42,592 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:55:42,592 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:42,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 557 transitions. [2025-04-26 16:55:42,595 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:42,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 158 states and 310 transitions. [2025-04-26 16:55:42,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 16:55:42,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 16:55:42,596 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 310 transitions. [2025-04-26 16:55:42,596 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:42,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 310 transitions. [2025-04-26 16:55:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 310 transitions. [2025-04-26 16:55:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-04-26 16:55:42,602 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 16:55:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 251 transitions. [2025-04-26 16:55:42,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 16:55:42,606 INFO L438 stractBuchiCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 16:55:42,606 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:42,607 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 251 transitions. [2025-04-26 16:55:42,608 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:42,608 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:42,608 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:42,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:42,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:42,610 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: 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] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_min3_1) (= v_i_6 v_min2_3) (= v_i_6 v_min1_3)) InVars {min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} OutVars{min2=v_min2_3, i=v_i_6, min3=v_min3_1, min1=v_min1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: 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] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-1-->L23: 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] L59-1-->L34-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] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_min1_5 (let ((.cse0 (select v_A_4 v_i_8))) (ite (< .cse0 v_min1_6) .cse0 v_min1_6)))) InVars {A=v_A_4, i=v_i_8, min1=v_min1_6} OutVars{A=v_A_4, i=v_i_7, min1=v_min1_5} AuxVars[] AssignedVars[min1, i]" "[87] L60-->L45-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] L23-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] L34-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 16:55:42,610 INFO L754 eck$LassoCheckResult]: Loop: "[76] L45-1-->L45: 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] L45-->L45-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (let ((.cse0 (select v_A_8 v_k_8))) (ite (< .cse0 v_min3_6) .cse0 v_min3_6)) v_min3_5)) InVars {A=v_A_8, min3=v_min3_6, k=v_k_8} OutVars{A=v_A_8, min3=v_min3_5, k=v_k_7} AuxVars[] AssignedVars[min3, k]" [2025-04-26 16:55:42,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1810535149, now seen corresponding path program 1 times [2025-04-26 16:55:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:42,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763460015] [2025-04-26 16:55:42,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:42,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:42,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:42,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:42,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:42,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:42,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:42,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:42,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:55:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:42,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724778631] [2025-04-26 16:55:42,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:42,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:42,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:42,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:42,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:42,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:42,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:42,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:42,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:42,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:42,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -462520875, now seen corresponding path program 1 times [2025-04-26 16:55:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:42,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321216618] [2025-04-26 16:55:42,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:42,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:42,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:42,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:42,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:42,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:42,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:42,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:42,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:42,814 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:42,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:42,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:42,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:42,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:42,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:42,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:42,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:42,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-array-hom.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:42,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:42,815 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:42,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:42,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:43,089 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:43,089 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:43,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,091 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:55:43,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,108 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:55:43,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,145 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 16:55:43,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:55:43,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,165 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,171 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 16:55:43,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:55:43,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:55:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,197 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:55:43,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:55:43,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,220 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:55:43,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 16:55:43,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,243 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 16:55:43,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,245 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:55:43,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,257 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:55:43,257 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:55:43,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,264 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:55:43,264 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:55:43,283 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:43,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:43,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,291 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:55:43,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:43,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:43,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:43,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:43,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:43,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:43,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:43,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:43,318 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:55:43,318 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:55:43,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:43,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:43,320 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:43,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:55:43,321 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:43,337 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 16:55:43,337 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:43,338 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:43,338 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:55:43,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:43,344 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:43,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:43,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:43,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:43,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:43,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:43,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:43,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:43,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:43,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:43,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:43,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:43,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:43,396 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:43,396 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 16:55:43,444 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 16:55:43,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:43,445 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 16:55:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:55:43,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:43,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:43,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:43,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:43,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:55:43,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:43,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 442 transitions. [2025-04-26 16:55:43,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:43,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2025-04-26 16:55:43,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:43,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:43,447 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:43,447 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:43,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:43,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:43,447 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:43,447 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:43,447 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:43,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:43,447 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:43,460 INFO L201 PluginConnector]: Adding new model min-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:43 BoogieIcfgContainer [2025-04-26 16:55:43,460 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:43,460 INFO L158 Benchmark]: Toolchain (without parser) took 3941.94ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:43,461 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.04ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:43,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.81ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:43,461 INFO L158 Benchmark]: Boogie Preprocessor took 19.84ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:43,461 INFO L158 Benchmark]: RCFGBuilder took 194.68ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 73.7MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:43,461 INFO L158 Benchmark]: BuchiAutomizer took 3682.67ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.7MB in the beginning and 84.8MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:43,462 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.04ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.81ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.84ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 194.68ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 73.7MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3682.67ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.7MB in the beginning and 84.8MB in the end (delta: -11.1MB). 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 3.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. 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, 220 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 60 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital104 mio100 ax100 hnf100 lsp216 ukn43 mio100 lsp65 div100 bol100 ite100 ukn100 eq156 hnf95 smp100 dnf465 smp47 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 5 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 204, 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 16:55:43,473 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...