/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:30,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:30,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:30,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:30,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:30,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:30,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:30,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:30,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:30,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:30,818 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:30,819 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:30,819 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:30,819 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:30,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:30,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:30,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:30,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:30,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:30,822 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:30,822 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:31,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:31,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:31,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:31,061 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:31,062 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:31,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl [2025-04-26 16:21:31,065 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2025-04-26 16:21:31,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:31,086 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:31,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:31,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:31,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:31,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,114 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:31,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:31,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:31,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:31,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:31,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:31,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:31,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:31,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:31,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/1) ... [2025-04-26 16:21:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,161 INFO L229 MonitoredProcess]: Starting monitored process 1 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:21:31,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:31,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2025-04-26 16:21:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2025-04-26 16:21:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2025-04-26 16:21:31,185 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:31,185 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2025-04-26 16:21:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2025-04-26 16:21:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2025-04-26 16:21:31,185 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2025-04-26 16:21:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2025-04-26 16:21:31,186 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2025-04-26 16:21:31,186 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2025-04-26 16:21:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2025-04-26 16:21:31,186 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2025-04-26 16:21:31,186 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:21:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:21:31,186 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:21:31,186 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:21:31,224 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:31,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:31,326 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:31,326 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:31,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:31,344 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:21:31,344 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:31 BoogieIcfgContainer [2025-04-26 16:21:31,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:31,347 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:31,347 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:31,351 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:31,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:31,352 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:31" (1/2) ... [2025-04-26 16:21:31,353 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2333dc9a and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:31, skipping insertion in model container [2025-04-26 16:21:31,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:31,353 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:31" (2/2) ... [2025-04-26 16:21:31,354 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2025-04-26 16:21:31,418 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:21:31,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 132 flow [2025-04-26 16:21:31,481 INFO L116 PetriNetUnfolderBase]: 5/40 cut-off events. [2025-04-26 16:21:31,482 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:21:31,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 40 events. 5/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-26 16:21:31,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 132 flow [2025-04-26 16:21:31,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2025-04-26 16:21:31,491 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 40 transitions, 107 flow [2025-04-26 16:21:31,499 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:31,500 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:31,500 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:31,500 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:31,500 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:31,500 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:31,500 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:31,500 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:31,501 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:32,007 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 4456 [2025-04-26 16:21:32,007 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:32,007 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:32,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:32,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:32,011 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:32,011 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 4703 states, but on-demand construction may add more states [2025-04-26 16:21:32,123 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 4456 [2025-04-26 16:21:32,124 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:32,124 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:32,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:32,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:32,128 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1]" [2025-04-26 16:21:32,129 INFO L754 eck$LassoCheckResult]: Loop: "[114] L36-1-->L36: Formula: (< v_i1_3 v_k_4) InVars {i1=v_i1_3, k=v_k_4} OutVars{i1=v_i1_3, k=v_k_4} AuxVars[] AssignedVars[]" "[116] L36-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_9 v_i1_9))) (ite (< v_array_min_15 .cse0) v_array_min_15 .cse0)) v_array_min_14) (= (+ v_i1_9 1) v_i1_8)) InVars {A=v_A_9, i1=v_i1_9, array_min=v_array_min_15} OutVars{A=v_A_9, i1=v_i1_8, array_min=v_array_min_14} AuxVars[] AssignedVars[array_min, i1]" [2025-04-26 16:21:32,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 127812647, now seen corresponding path program 1 times [2025-04-26 16:21:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:32,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833754091] [2025-04-26 16:21:32,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:32,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:32,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:32,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:32,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:32,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:32,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2025-04-26 16:21:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:32,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329073131] [2025-04-26 16:21:32,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:32,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:32,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:32,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:32,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1726094167, now seen corresponding path program 1 times [2025-04-26 16:21:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:32,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921018625] [2025-04-26 16:21:32,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:32,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:32,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:32,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:32,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:32,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:32,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:32,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:32,455 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:32,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:32,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:32,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:32,456 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:32,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:32,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:32,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:32,457 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:32,457 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:32,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,678 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:32,684 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,696 INFO L229 MonitoredProcess]: Starting monitored process 2 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:21:32,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:32,699 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:21:32,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:32,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:32,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:32,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:32,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:32,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:32,771 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:32,785 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:32,785 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:32,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,789 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:21:32,790 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:21:32,791 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:32,807 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:21:32,807 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:32,808 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:32,808 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2025-04-26 16:21:32,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:21:32,816 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:32,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:32,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:32,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:32,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:32,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:32,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:32,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:32,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:32,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:32,882 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:21:32,912 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:21:32,915 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 4703 states, but on-demand construction may add more states 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:21:33,389 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 4703 states, but on-demand construction may add more states. 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 12522 states and 71683 transitions. Complement of second has 6 states. [2025-04-26 16:21:33,390 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:21:33,394 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:21:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:21:33,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:21:33,401 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:33,401 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:21:33,401 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:33,401 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:21:33,401 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:33,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12522 states and 71683 transitions. [2025-04-26 16:21:33,702 INFO L131 ngComponentsAnalysis]: Automaton has 863 accepting balls. 4322 [2025-04-26 16:21:33,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12522 states to 10051 states and 58010 transitions. [2025-04-26 16:21:33,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5415 [2025-04-26 16:21:33,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7733 [2025-04-26 16:21:33,985 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10051 states and 58010 transitions. [2025-04-26 16:21:33,986 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:33,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10051 states and 58010 transitions. [2025-04-26 16:21:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10051 states and 58010 transitions. [2025-04-26 16:21:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10051 to 7736. [2025-04-26 16:21:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7736 states, 7736 states have (on average 6.015899689762151) internal successors, (in total 46539), 7735 states have internal predecessors, (46539), 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:21:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7736 states to 7736 states and 46539 transitions. [2025-04-26 16:21:34,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7736 states and 46539 transitions. [2025-04-26 16:21:34,473 INFO L438 stractBuchiCegarLoop]: Abstraction has 7736 states and 46539 transitions. [2025-04-26 16:21:34,473 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:34,473 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7736 states and 46539 transitions. [2025-04-26 16:21:34,531 INFO L131 ngComponentsAnalysis]: Automaton has 863 accepting balls. 4322 [2025-04-26 16:21:34,531 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:34,531 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:34,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:21:34,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:34,532 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[107] $Ultimate##0-->L48-1: Formula: (= v_i2_1 (+ v_k_1 1)) InVars {k=v_k_1} OutVars{i2=v_i2_1, k=v_k_1} AuxVars[] AssignedVars[i2]" [2025-04-26 16:21:34,532 INFO L754 eck$LassoCheckResult]: Loop: "[109] L48-1-->L48: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[]" "[111] L48-->L48-1: Formula: (and (= v_i2_8 (+ v_i2_9 1)) (= (let ((.cse0 (select v_A_7 v_i2_9))) (ite (< v_array_min_11 .cse0) v_array_min_11 .cse0)) v_array_min_10)) InVars {A=v_A_7, i2=v_i2_9, array_min=v_array_min_11} OutVars{A=v_A_7, i2=v_i2_8, array_min=v_array_min_10} AuxVars[] AssignedVars[array_min, i2]" [2025-04-26 16:21:34,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -332774171, now seen corresponding path program 1 times [2025-04-26 16:21:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:34,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650854803] [2025-04-26 16:21:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:34,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:34,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:34,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:34,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:34,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:34,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:34,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:34,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 16:21:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:34,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974222957] [2025-04-26 16:21:34,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:34,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:34,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:34,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:34,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:34,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:34,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:34,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:34,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1968394937, now seen corresponding path program 1 times [2025-04-26 16:21:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:34,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333280641] [2025-04-26 16:21:34,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:34,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:34,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:34,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:34,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:34,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:34,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:34,677 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:34,678 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:34,678 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:34,678 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:34,678 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:34,678 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:34,678 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:34,678 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:34,678 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:34,678 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:34,678 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:34,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:34,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:34,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:34,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:34,811 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:34,811 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:34,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:34,813 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:21:34,815 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:21:34,816 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:21:34,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:34,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:34,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:34,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:34,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:34,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:34,831 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:34,836 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:21:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:34,838 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:21:34,839 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:21:34,841 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:21:34,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:34,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:34,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:34,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:34,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:34,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:34,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:34,862 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:21:34,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:34,864 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:21:34,865 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:21:34,866 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:21:34,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:34,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:34,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:34,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:34,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:34,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:34,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:34,894 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:34,895 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:34,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:34,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:34,897 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:21:34,898 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:21:34,900 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:34,918 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:21:34,918 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:34,918 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:34,918 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 16:21:34,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:34,926 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:34,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:34,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:34,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:34,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:34,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:34,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:34,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:34,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:34,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:34,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:34,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:34,980 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:21:34,980 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:21:34,981 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7736 states and 46539 transitions. cyclomatic complexity: 39871 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:21:35,523 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7736 states and 46539 transitions. cyclomatic complexity: 39871. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 23978 states and 153568 transitions. Complement of second has 6 states. [2025-04-26 16:21:35,523 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:21:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:21:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:21:35,524 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:21:35,524 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:35,524 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:21:35,525 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:35,525 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:21:35,525 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:35,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23978 states and 153568 transitions. [2025-04-26 16:21:36,106 INFO L131 ngComponentsAnalysis]: Automaton has 922 accepting balls. 4084 [2025-04-26 16:21:36,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23978 states to 18632 states and 119240 transitions. [2025-04-26 16:21:36,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7120 [2025-04-26 16:21:36,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9761 [2025-04-26 16:21:36,468 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18632 states and 119240 transitions. [2025-04-26 16:21:36,468 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:36,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18632 states and 119240 transitions. [2025-04-26 16:21:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18632 states and 119240 transitions. [2025-04-26 16:21:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18632 to 14475. [2025-04-26 16:21:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14475 states, 14475 states have (on average 6.552746113989637) internal successors, (in total 94851), 14474 states have internal predecessors, (94851), 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:21:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14475 states to 14475 states and 94851 transitions. [2025-04-26 16:21:37,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14475 states and 94851 transitions. [2025-04-26 16:21:37,093 INFO L438 stractBuchiCegarLoop]: Abstraction has 14475 states and 94851 transitions. [2025-04-26 16:21:37,093 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:37,093 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14475 states and 94851 transitions. [2025-04-26 16:21:37,234 INFO L131 ngComponentsAnalysis]: Automaton has 922 accepting balls. 4084 [2025-04-26 16:21:37,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:37,234 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:37,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:37,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:37,235 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2]" "[122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3]" [2025-04-26 16:21:37,236 INFO L754 eck$LassoCheckResult]: Loop: "[124] L61-1-->L61: Formula: (< v_i3_1 v_k_6) InVars {i3=v_i3_1, k=v_k_6} OutVars{i3=v_i3_1, k=v_k_6} AuxVars[] AssignedVars[]" "[126] L61-->L61-1: Formula: (and (= v_i3_8 (+ v_i3_9 1)) (= (let ((.cse0 (select v_A_13 v_i3_9))) (ite (< v_array_max_15 .cse0) .cse0 v_array_max_15)) v_array_max_14)) InVars {A=v_A_13, array_max=v_array_max_15, i3=v_i3_9} OutVars{A=v_A_13, array_max=v_array_max_14, i3=v_i3_8} AuxVars[] AssignedVars[array_max, i3]" [2025-04-26 16:21:37,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1726063378, now seen corresponding path program 1 times [2025-04-26 16:21:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:37,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957575174] [2025-04-26 16:21:37,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:37,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:37,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:37,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:37,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:37,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:37,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2025-04-26 16:21:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:37,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813736651] [2025-04-26 16:21:37,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:37,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:37,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:37,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:37,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:37,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:37,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -889526032, now seen corresponding path program 1 times [2025-04-26 16:21:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:37,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486181257] [2025-04-26 16:21:37,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:37,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:37,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:37,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:37,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:37,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:37,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:37,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:37,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:37,395 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:37,395 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:37,395 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:37,395 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:37,395 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:37,395 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,395 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:37,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:37,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:37,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:37,396 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:37,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:37,663 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:37,663 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:37,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:37,668 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:21:37,668 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:21:37,669 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:21:37,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:37,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:37,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:37,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:37,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:37,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:37,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:37,691 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:21:37,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:37,693 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:21:37,694 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:21:37,695 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:21:37,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:37,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:37,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:37,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:37,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:37,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:37,712 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:37,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:37,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:37,720 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:21:37,721 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:21:37,724 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:21:37,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:37,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:37,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:37,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:37,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:37,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:37,740 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:37,745 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:21:37,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:37,747 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:21:37,749 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:21:37,750 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:21:37,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:37,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:37,760 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:37,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:37,767 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:37,767 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:37,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:37,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:37,784 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:21:37,785 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:21:37,786 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:21:37,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:37,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:37,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:37,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:37,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:37,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:37,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:37,807 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:37,807 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:37,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:37,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:37,809 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:21:37,810 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:21:37,811 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:37,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:37,826 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:37,826 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:37,826 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, i3) = 1*k - 1*i3 Supporting invariants [] [2025-04-26 16:21:37,831 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:21:37,832 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:37,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:37,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:37,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:37,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:37,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:37,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:37,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:37,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:37,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:37,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:37,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:37,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:37,877 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:21:37,877 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:21:37,878 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14475 states and 94851 transitions. cyclomatic complexity: 81915 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:38,496 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14475 states and 94851 transitions. cyclomatic complexity: 81915. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 45457 states and 305698 transitions. Complement of second has 6 states. [2025-04-26 16:21:38,496 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:21:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:21:38,497 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:21:38,497 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:38,497 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:21:38,497 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:38,497 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:21:38,497 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:38,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45457 states and 305698 transitions. [2025-04-26 16:21:39,305 INFO L131 ngComponentsAnalysis]: Automaton has 909 accepting balls. 3698 [2025-04-26 16:21:39,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45457 states to 33498 states and 224712 transitions. [2025-04-26 16:21:39,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9503 [2025-04-26 16:21:39,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12088 [2025-04-26 16:21:39,909 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33498 states and 224712 transitions. [2025-04-26 16:21:39,909 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:39,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33498 states and 224712 transitions. [2025-04-26 16:21:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33498 states and 224712 transitions. [2025-04-26 16:21:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33498 to 26459. [2025-04-26 16:21:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26459 states, 26459 states have (on average 6.822933595373975) internal successors, (in total 180528), 26458 states have internal predecessors, (180528), 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:21:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26459 states to 26459 states and 180528 transitions. [2025-04-26 16:21:41,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26459 states and 180528 transitions. [2025-04-26 16:21:41,044 INFO L438 stractBuchiCegarLoop]: Abstraction has 26459 states and 180528 transitions. [2025-04-26 16:21:41,044 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:41,044 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26459 states and 180528 transitions. [2025-04-26 16:21:41,330 INFO L131 ngComponentsAnalysis]: Automaton has 909 accepting balls. 3698 [2025-04-26 16:21:41,330 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:41,330 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:41,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:41,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:21:41,331 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2]" "[134] L102-->$Ultimate##0: Formula: (and (= v_computeMax2Thread1of1ForFork0_thidvar1_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar3_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar2_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar0_2 4)) InVars {} OutVars{computeMax2Thread1of1ForFork0_thidvar3=v_computeMax2Thread1of1ForFork0_thidvar3_2, computeMax2Thread1of1ForFork0_thidvar2=v_computeMax2Thread1of1ForFork0_thidvar2_2, computeMax2Thread1of1ForFork0_thidvar1=v_computeMax2Thread1of1ForFork0_thidvar1_2, computeMax2Thread1of1ForFork0_thidvar0=v_computeMax2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMax2Thread1of1ForFork0_thidvar3, computeMax2Thread1of1ForFork0_thidvar2, computeMax2Thread1of1ForFork0_thidvar1, computeMax2Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L74-1: Formula: (= v_i4_1 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_5, i4=v_i4_1} AuxVars[] AssignedVars[i4]" [2025-04-26 16:21:41,331 INFO L754 eck$LassoCheckResult]: Loop: "[119] L74-1-->L74: Formula: (< v_i4_2 v_N_4) InVars {N=v_N_4, i4=v_i4_2} OutVars{N=v_N_4, i4=v_i4_2} AuxVars[] AssignedVars[]" "[121] L74-->L74-1: Formula: (and (= (let ((.cse0 (select v_A_11 v_i4_9))) (ite (< v_array_max_11 .cse0) .cse0 v_array_max_11)) v_array_max_10) (= (+ v_i4_9 1) v_i4_8)) InVars {A=v_A_11, array_max=v_array_max_11, i4=v_i4_9} OutVars{A=v_A_11, array_max=v_array_max_10, i4=v_i4_8} AuxVars[] AssignedVars[array_max, i4]" [2025-04-26 16:21:41,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356677, now seen corresponding path program 1 times [2025-04-26 16:21:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:41,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816087887] [2025-04-26 16:21:41,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:41,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:41,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:41,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:41,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:41,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:41,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:41,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:41,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:41,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:41,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 4771, now seen corresponding path program 1 times [2025-04-26 16:21:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:41,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063289503] [2025-04-26 16:21:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:41,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:41,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:41,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:41,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:41,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:41,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:41,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:41,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:41,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:41,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1805152547, now seen corresponding path program 1 times [2025-04-26 16:21:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:41,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997646353] [2025-04-26 16:21:41,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:41,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:41,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:41,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:41,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:41,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:41,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:41,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:41,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:41,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:41,516 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:41,516 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:41,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:41,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:41,516 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:41,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,516 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:41,516 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:41,516 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:21:41,516 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:41,516 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:41,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:41,734 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:41,734 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:41,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,736 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:21:41,737 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:21:41,739 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:21:41,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,754 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,759 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:21:41,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,762 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:21:41,762 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:21:41,765 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:21:41,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,780 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,786 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:21:41,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,789 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:21:41,791 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:21:41,792 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:21:41,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,807 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,813 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:21:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,833 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:21:41,834 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:21:41,834 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:21:41,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,848 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:21:41,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,856 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:21:41,857 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:21:41,858 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:21:41,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,872 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,878 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:21:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,880 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:41,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:21:41,882 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:21:41,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,896 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:21:41,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,907 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:41,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:21:41,910 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:21:41,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,924 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:21:41,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,932 INFO L229 MonitoredProcess]: Starting monitored process 21 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:21:41,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:21:41,934 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:21:41,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,944 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:41,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,952 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:41,952 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:41,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:41,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:21:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:41,972 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:41,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:21:41,976 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:21:41,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:41,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:41,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:41,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:41,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:41,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:41,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:41,999 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:42,000 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:42,002 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:42,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:21:42,005 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:42,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:21:42,022 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:42,022 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:42,022 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i4, N) = -1*i4 + 1*N Supporting invariants [] [2025-04-26 16:21:42,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:21:42,030 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:42,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:42,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:42,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:42,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:42,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:42,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:42,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:42,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:42,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:42,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:42,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:42,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:42,077 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:21:42,078 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:21:42,078 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26459 states and 180528 transitions. cyclomatic complexity: 156268 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:43,274 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26459 states and 180528 transitions. cyclomatic complexity: 156268. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 80934 states and 561853 transitions. Complement of second has 6 states. [2025-04-26 16:21:43,274 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:21:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:21:43,275 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:21:43,275 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:43,275 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:21:43,275 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:43,275 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:21:43,275 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:43,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80934 states and 561853 transitions. [2025-04-26 16:21:45,838 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 3136 [2025-04-26 16:21:46,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80934 states to 54826 states and 379327 transitions. [2025-04-26 16:21:46,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11817 [2025-04-26 16:21:46,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14056 [2025-04-26 16:21:46,688 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54826 states and 379327 transitions. [2025-04-26 16:21:46,688 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:46,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54826 states and 379327 transitions. [2025-04-26 16:21:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54826 states and 379327 transitions. [2025-04-26 16:21:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54826 to 44089. [2025-04-26 16:21:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44089 states, 44089 states have (on average 7.0269681780035835) internal successors, (in total 309812), 44088 states have internal predecessors, (309812), 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:21:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44089 states to 44089 states and 309812 transitions. [2025-04-26 16:21:48,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44089 states and 309812 transitions. [2025-04-26 16:21:48,789 INFO L438 stractBuchiCegarLoop]: Abstraction has 44089 states and 309812 transitions. [2025-04-26 16:21:48,790 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:48,790 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44089 states and 309812 transitions. [2025-04-26 16:21:49,185 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 3136 [2025-04-26 16:21:49,185 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:49,185 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:49,186 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:49,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:49,186 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2]" "[134] L102-->$Ultimate##0: Formula: (and (= v_computeMax2Thread1of1ForFork0_thidvar1_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar3_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar2_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar0_2 4)) InVars {} OutVars{computeMax2Thread1of1ForFork0_thidvar3=v_computeMax2Thread1of1ForFork0_thidvar3_2, computeMax2Thread1of1ForFork0_thidvar2=v_computeMax2Thread1of1ForFork0_thidvar2_2, computeMax2Thread1of1ForFork0_thidvar1=v_computeMax2Thread1of1ForFork0_thidvar1_2, computeMax2Thread1of1ForFork0_thidvar0=v_computeMax2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMax2Thread1of1ForFork0_thidvar3, computeMax2Thread1of1ForFork0_thidvar2, computeMax2Thread1of1ForFork0_thidvar1, computeMax2Thread1of1ForFork0_thidvar0]" "[137] L103-->L84: Formula: (and (= 5 v_sampleThread1of1ForFork1_thidvar4_2) (= 5 v_sampleThread1of1ForFork1_thidvar1_2) (= 5 v_sampleThread1of1ForFork1_thidvar0_2) (= 5 v_sampleThread1of1ForFork1_thidvar3_2) (= 5 v_sampleThread1of1ForFork1_thidvar2_2)) InVars {} OutVars{sampleThread1of1ForFork1_thidvar1=v_sampleThread1of1ForFork1_thidvar1_2, sampleThread1of1ForFork1_thidvar0=v_sampleThread1of1ForFork1_thidvar0_2, sampleThread1of1ForFork1_thidvar3=v_sampleThread1of1ForFork1_thidvar3_2, sampleThread1of1ForFork1_thidvar2=v_sampleThread1of1ForFork1_thidvar2_2, sampleThread1of1ForFork1_thidvar4=v_sampleThread1of1ForFork1_thidvar4_2} AuxVars[] AssignedVars[sampleThread1of1ForFork1_thidvar1, sampleThread1of1ForFork1_thidvar0, sampleThread1of1ForFork1_thidvar3, sampleThread1of1ForFork1_thidvar2, sampleThread1of1ForFork1_thidvar4]" [2025-04-26 16:21:49,186 INFO L754 eck$LassoCheckResult]: Loop: "[128] L84-->L86: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_7) v_array_min_8)) InVars {min_samples=v_min_samples_2, i1=v_i1_7, array_min=v_array_min_8} OutVars{min_samples=v_min_samples_1, i1=v_i1_7, array_min=v_array_min_8} AuxVars[] AssignedVars[min_samples]" "[129] L86-->L87: Formula: (= v_min_samples_3 (store v_min_samples_4 (+ (- 1) v_i2_7) v_array_min_9)) InVars {min_samples=v_min_samples_4, i2=v_i2_7, array_min=v_array_min_9} OutVars{min_samples=v_min_samples_3, i2=v_i2_7, array_min=v_array_min_9} AuxVars[] AssignedVars[min_samples]" "[130] L87-->L88: Formula: (= (store v_max_samples_2 (+ (- 1) v_i3_7) v_array_max_8) v_max_samples_1) InVars {array_max=v_array_max_8, max_samples=v_max_samples_2, i3=v_i3_7} OutVars{array_max=v_array_max_8, max_samples=v_max_samples_1, i3=v_i3_7} AuxVars[] AssignedVars[max_samples]" "[131] L88-->L84: Formula: (= (store v_max_samples_4 (+ (- 1) v_i4_7) v_array_max_9) v_max_samples_3) InVars {array_max=v_array_max_9, max_samples=v_max_samples_4, i4=v_i4_7} OutVars{array_max=v_array_max_9, max_samples=v_max_samples_3, i4=v_i4_7} AuxVars[] AssignedVars[max_samples]" [2025-04-26 16:21:49,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356657, now seen corresponding path program 1 times [2025-04-26 16:21:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:49,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506136552] [2025-04-26 16:21:49,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:49,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:49,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:49,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:49,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:49,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:49,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 4864899, now seen corresponding path program 1 times [2025-04-26 16:21:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:49,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302055470] [2025-04-26 16:21:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:49,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:49,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:49,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:49,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 433940305, now seen corresponding path program 1 times [2025-04-26 16:21:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:49,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940915340] [2025-04-26 16:21:49,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:21:49,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:21:49,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:21:49,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:21:49,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:49,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:49,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:49,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:49,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:49,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:49,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:49,418 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:49 BoogieIcfgContainer [2025-04-26 16:21:49,419 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:49,419 INFO L158 Benchmark]: Toolchain (without parser) took 18333.21ms. Allocated memory was 163.6MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 89.6MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-26 16:21:49,419 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.04ms. Allocated memory is still 163.6MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:49,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.48ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 87.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:49,420 INFO L158 Benchmark]: Boogie Preprocessor took 18.70ms. Allocated memory is still 163.6MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:49,420 INFO L158 Benchmark]: RCFGBuilder took 208.49ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 75.9MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:21:49,420 INFO L158 Benchmark]: BuchiAutomizer took 18071.90ms. Allocated memory was 163.6MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 75.9MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-26 16:21:49,421 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 163.6MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.48ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 87.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.70ms. Allocated memory is still 163.6MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 208.49ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 75.9MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 18071.90ms. Allocated memory was 163.6MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 75.9MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 4.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 24248 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 6.2s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 204 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp110 ukn59 mio100 lsp56 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf149 smp63 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function k + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i3 + k and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i4 and consists of 4 locations. The remainder module has 44089 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 84]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L95] 0 assume 0 <= k && k <= N; VAL [N=0, k=0] [L97] 0 array_min := A[0]; VAL [N=0, array_min=8, k=0] [L98] 0 array_max := A[0]; VAL [N=0, array_max=8, array_min=8, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=8, array_min=8, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=8, array_min=8, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=8, array_min=8, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=8, array_min=8, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=8, array_min=8, k=0] Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 84]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L95] 0 assume 0 <= k && k <= N; VAL [N=0, k=0] [L97] 0 array_min := A[0]; VAL [N=0, array_min=8, k=0] [L98] 0 array_max := A[0]; VAL [N=0, array_max=8, array_min=8, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=8, array_min=8, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=8, array_min=8, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=8, array_min=8, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=8, array_min=8, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=8, array_min=8, k=0] Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:21:49,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...