/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:12,559 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:12,619 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:37:12,644 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:12,644 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:12,644 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:12,648 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:12,649 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:12,649 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:12,653 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:12,653 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:12,653 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:12,654 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:12,655 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:12,655 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:12,656 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:12,656 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:12,656 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:12,656 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:12,656 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:12,656 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:12,657 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:12,658 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:12,658 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:12,658 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:12,658 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:12,658 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:12,659 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:12,659 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:12,659 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:12,660 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:12,660 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:12,660 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:12,661 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:12,661 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:37:12,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:12,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:12,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:12,847 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:12,848 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:12,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl [2023-10-12 17:37:12,849 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2023-10-12 17:37:12,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:12,874 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:12,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:12,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:12,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:12,883 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,888 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,892 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:12,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:12,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:12,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:12,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:12,899 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,899 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,900 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,900 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,902 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,905 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,906 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,906 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 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:12,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:12,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:12,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:12,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:12,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:12,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:12,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2023-10-12 17:37:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2023-10-12 17:37:12,973 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2023-10-12 17:37:12,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:12,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:12,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2023-10-12 17:37:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2023-10-12 17:37:12,973 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2023-10-12 17:37:12,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2023-10-12 17:37:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2023-10-12 17:37:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2023-10-12 17:37:12,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2023-10-12 17:37:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2023-10-12 17:37:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2023-10-12 17:37:12,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:37:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:37:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:37:12,975 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:13,014 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:13,015 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:13,118 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:13,131 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:13,132 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:37:13,133 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:13 BoogieIcfgContainer [2023-10-12 17:37:13,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:13,134 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:13,134 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:13,137 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:13,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:13,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/2) ... [2023-10-12 17:37:13,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49e7159c and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:13, skipping insertion in model container [2023-10-12 17:37:13,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:13,139 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 12.10 05:37:13" (2/2) ... [2023-10-12 17:37:13,140 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2023-10-12 17:37:13,208 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:37:13,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 137 flow [2023-10-12 17:37:13,250 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2023-10-12 17:37:13,250 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:13,254 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. [2023-10-12 17:37:13,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 137 flow [2023-10-12 17:37:13,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2023-10-12 17:37:13,261 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:13,270 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 107 flow [2023-10-12 17:37:13,272 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 107 flow [2023-10-12 17:37:13,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 107 flow [2023-10-12 17:37:13,282 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2023-10-12 17:37:13,282 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:13,283 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. [2023-10-12 17:37:13,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 730 [2023-10-12 17:37:13,485 INFO L134 LiptonReduction]: Checked pairs total: 767 [2023-10-12 17:37:13,485 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:37:13,494 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:13,494 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:13,494 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:13,495 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:13,495 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:13,495 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:13,495 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:13,495 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:13,495 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 29 transitions, 85 flow [2023-10-12 17:37:13,500 ERROR L47 etriNetUnfolderRabin]: [1:1A:[161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max][28], 2:2A:[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0][14], 4:3A:[112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1][7]][5:4A:[155] L36-1-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_23 v_i1_17))) (ite (< v_array_min_27 .cse0) v_array_min_27 .cse0)) v_array_min_26) (< v_i1_17 v_k_14) (= (+ v_i1_17 1) v_i1_16)) InVars {A=v_A_23, array_min=v_array_min_27, k=v_k_14, i1=v_i1_17} OutVars{A=v_A_23, array_min=v_array_min_26, k=v_k_14, i1=v_i1_16} AuxVars[] AssignedVars[array_min, i1][27]] [2023-10-12 17:37:13,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:13,505 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:13,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:13,505 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:13,507 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:13,508 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 29 transitions, 85 flow [2023-10-12 17:37:13,510 ERROR L47 etriNetUnfolderRabin]: [1:1A:[161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max][28], 2:2A:[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0][14], 4:3A:[112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1][7]][5:4A:[155] L36-1-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_23 v_i1_17))) (ite (< v_array_min_27 .cse0) v_array_min_27 .cse0)) v_array_min_26) (< v_i1_17 v_k_14) (= (+ v_i1_17 1) v_i1_16)) InVars {A=v_A_23, array_min=v_array_min_27, k=v_k_14, i1=v_i1_17} OutVars{A=v_A_23, array_min=v_array_min_26, k=v_k_14, i1=v_i1_16} AuxVars[] AssignedVars[array_min, i1][27]] [2023-10-12 17:37:13,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:13,510 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:13,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:13,511 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:13,514 INFO L748 eck$LassoCheckResult]: Stem: 60#[$Ultimate##0]true [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]true [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[L100-1, $Ultimate##0]true [112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1] 66#[L100-1, L36-1]true [2023-10-12 17:37:13,514 INFO L750 eck$LassoCheckResult]: Loop: 66#[L100-1, L36-1]true [155] L36-1-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_23 v_i1_17))) (ite (< v_array_min_27 .cse0) v_array_min_27 .cse0)) v_array_min_26) (< v_i1_17 v_k_14) (= (+ v_i1_17 1) v_i1_16)) InVars {A=v_A_23, array_min=v_array_min_27, k=v_k_14, i1=v_i1_17} OutVars{A=v_A_23, array_min=v_array_min_26, k=v_k_14, i1=v_i1_16} AuxVars[] AssignedVars[array_min, i1] 66#[L100-1, L36-1]true [2023-10-12 17:37:13,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 188964, now seen corresponding path program 1 times [2023-10-12 17:37:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456194166] [2023-10-12 17:37:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 186, now seen corresponding path program 1 times [2023-10-12 17:37:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6106581] [2023-10-12 17:37:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 5858039, now seen corresponding path program 1 times [2023-10-12 17:37:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25672967] [2023-10-12 17:37:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,862 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:13,862 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:13,862 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:13,863 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:13,863 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:13,863 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,863 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:13,863 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:13,863 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:13,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:13,863 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:13,875 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:13,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:14,000 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:14,002 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:37:14,053 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 [2023-10-12 17:37:14,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:14,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:14,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:14,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,181 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 [2023-10-12 17:37:14,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,188 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:14,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:37:14,200 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:14,200 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:14,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:14,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:37:14,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,256 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 [2023-10-12 17:37:14,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:14,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:14,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:37:14,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:14,304 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:14,304 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:37:14,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:37:14,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:14,469 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:14,469 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:14,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2023-10-12 17:37:14,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:37:14,475 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:14,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:14,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:14,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:14,520 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:14,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:14,555 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-10-12 17:37:14,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:14,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:14,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:14,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:14,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:14,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:14,675 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 116 transitions, 572 flow [2023-10-12 17:37:14,676 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:14,676 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 116 transitions, 572 flow [2023-10-12 17:37:14,679 ERROR L47 etriNetUnfolderRabin]: [1:1A:[161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max][114], 2:2A:[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0][58], 3:3A:[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][2], 8:4A:[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][34]][9:5A:[159] L48-1-->L48-1: Formula: (and (< v_i2_25 v_N_12) (= (+ v_i2_25 1) v_i2_24) (= v_array_min_32 (let ((.cse0 (select v_A_29 v_i2_25))) (ite (< v_array_min_33 .cse0) v_array_min_33 .cse0)))) InVars {A=v_A_29, array_min=v_array_min_33, N=v_N_12, i2=v_i2_25} OutVars{A=v_A_29, array_min=v_array_min_32, N=v_N_12, i2=v_i2_24} AuxVars[] AssignedVars[array_min, i2][78]] [2023-10-12 17:37:14,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:14,679 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2023-10-12 17:37:14,680 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:14,680 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:14,680 INFO L748 eck$LassoCheckResult]: Stem: 60#[$Ultimate##0]true [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]true [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[L100-1, $Ultimate##0]true [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] 106#[L101, $Ultimate##0, $Ultimate##0]true [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] 108#[L101, L48-1, $Ultimate##0]true [2023-10-12 17:37:14,680 INFO L750 eck$LassoCheckResult]: Loop: 108#[L101, L48-1, $Ultimate##0]true [159] L48-1-->L48-1: Formula: (and (< v_i2_25 v_N_12) (= (+ v_i2_25 1) v_i2_24) (= v_array_min_32 (let ((.cse0 (select v_A_29 v_i2_25))) (ite (< v_array_min_33 .cse0) v_array_min_33 .cse0)))) InVars {A=v_A_29, array_min=v_array_min_33, N=v_N_12, i2=v_i2_25} OutVars{A=v_A_29, array_min=v_array_min_32, N=v_N_12, i2=v_i2_24} AuxVars[] AssignedVars[array_min, i2] 108#[L101, L48-1, $Ultimate##0]true [2023-10-12 17:37:14,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash 5858952, now seen corresponding path program 1 times [2023-10-12 17:37:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170935435] [2023-10-12 17:37:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash 190, now seen corresponding path program 1 times [2023-10-12 17:37:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615892816] [2023-10-12 17:37:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash 181627671, now seen corresponding path program 1 times [2023-10-12 17:37:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851186013] [2023-10-12 17:37:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,836 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:14,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:14,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:14,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:14,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:14,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:14,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:14,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:14,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:14,837 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:14,839 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:14,841 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:14,843 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:14,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:14,960 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:14,960 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:37:14,989 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 [2023-10-12 17:37:14,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:14,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:37:15,040 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 [2023-10-12 17:37:15,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,108 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 [2023-10-12 17:37:15,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:37:15,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:37:15,177 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 [2023-10-12 17:37:15,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:15,216 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:15,217 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:37:15,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:37:15,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:15,277 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:15,277 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:15,277 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2023-10-12 17:37:15,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:37:15,281 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:15,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:15,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:15,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:15,306 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:15,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:15,306 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-10-12 17:37:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:15,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:15,373 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 464 transitions, 3216 flow [2023-10-12 17:37:15,373 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:15,373 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 48 places, 464 transitions, 3216 flow [2023-10-12 17:37:15,377 ERROR L47 etriNetUnfolderRabin]: [1:1A:[161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max][458], 2:2A:[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0][234], 3:3A:[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][10], 10:4A:[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][170], 19:5A:[122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3][26]][20:6A:[157] L61-1-->L61-1: Formula: (and (= v_array_max_30 (let ((.cse0 (select v_A_25 v_i3_17))) (ite (< v_array_max_31 .cse0) .cse0 v_array_max_31))) (= (+ v_i3_17 1) v_i3_16) (< v_i3_17 v_k_18)) InVars {A=v_A_25, array_max=v_array_max_31, i3=v_i3_17, k=v_k_18} OutVars{A=v_A_25, array_max=v_array_max_30, i3=v_i3_16, k=v_k_18} AuxVars[] AssignedVars[array_max, i3][346]] [2023-10-12 17:37:15,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:15,378 INFO L124 PetriNetUnfolderBase]: 8/19 cut-off events. [2023-10-12 17:37:15,378 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:37:15,378 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:15,378 INFO L748 eck$LassoCheckResult]: Stem: 60#[$Ultimate##0]true [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]true [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[L100-1, $Ultimate##0]true [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] 106#[L101, $Ultimate##0, $Ultimate##0]true [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] 146#[$Ultimate##0, L102, $Ultimate##0, $Ultimate##0]true [122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3] 148#[L102, $Ultimate##0, L61-1, $Ultimate##0]true [2023-10-12 17:37:15,378 INFO L750 eck$LassoCheckResult]: Loop: 148#[L102, $Ultimate##0, L61-1, $Ultimate##0]true [157] L61-1-->L61-1: Formula: (and (= v_array_max_30 (let ((.cse0 (select v_A_25 v_i3_17))) (ite (< v_array_max_31 .cse0) .cse0 v_array_max_31))) (= (+ v_i3_17 1) v_i3_16) (< v_i3_17 v_k_18)) InVars {A=v_A_25, array_max=v_array_max_31, i3=v_i3_17, k=v_k_18} OutVars{A=v_A_25, array_max=v_array_max_30, i3=v_i3_16, k=v_k_18} AuxVars[] AssignedVars[array_max, i3] 148#[L102, $Ultimate##0, L61-1, $Ultimate##0]true [2023-10-12 17:37:15,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 181628843, now seen corresponding path program 1 times [2023-10-12 17:37:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818224381] [2023-10-12 17:37:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 188, now seen corresponding path program 1 times [2023-10-12 17:37:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128794852] [2023-10-12 17:37:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1335526994, now seen corresponding path program 1 times [2023-10-12 17:37:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643781886] [2023-10-12 17:37:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,474 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:15,474 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:15,474 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:15,474 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:15,474 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:15,474 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,475 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:15,475 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:15,475 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:37:15,475 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:15,475 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:15,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,478 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,512 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,514 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:15,619 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:15,619 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:15,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:37:15,658 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 [2023-10-12 17:37:15,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,698 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 [2023-10-12 17:37:15,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:37:15,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:37:15,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,727 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:37:15,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:15,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,751 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:37:15,754 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 [2023-10-12 17:37:15,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,760 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:15,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,766 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:15,766 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:15,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,790 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:37:15,805 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 [2023-10-12 17:37:15,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:15,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,861 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:15,861 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,863 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:15,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:15,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:37:15,921 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:15,921 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:15,922 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i3, k) = -1*i3 + 1*k Supporting invariants [] [2023-10-12 17:37:15,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:37:15,927 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:15,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:15,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:15,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:15,963 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:15,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:15,964 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-10-12 17:37:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:16,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:16,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:16,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:16,055 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 1856 transitions, 16576 flow [2023-10-12 17:37:16,055 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:16,055 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 52 places, 1856 transitions, 16576 flow [2023-10-12 17:37:16,075 ERROR L47 etriNetUnfolderRabin]: [1:1A:[161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max][1835], 2:2A:[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0][939], 3:3A:[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][43], 10:4A:[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][683], 21:5A:[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][235], 84:6A:[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][171]][85:7A:[152] L74-1-->L74-1: Formula: (and (= v_array_max_18 (let ((.cse0 (select v_A_15 v_i4_15))) (ite (< v_array_max_19 .cse0) .cse0 v_array_max_19))) (= v_i4_14 (+ v_i4_15 1)) (< v_i4_15 v_N_8)) InVars {A=v_A_15, N=v_N_8, array_max=v_array_max_19, i4=v_i4_15} OutVars{A=v_A_15, N=v_N_8, array_max=v_array_max_18, i4=v_i4_14} AuxVars[] AssignedVars[array_max, i4][1515]] [2023-10-12 17:37:16,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:16,075 INFO L124 PetriNetUnfolderBase]: 55/84 cut-off events. [2023-10-12 17:37:16,075 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-10-12 17:37:16,075 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:16,076 INFO L748 eck$LassoCheckResult]: Stem: 60#[$Ultimate##0]true [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]true [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[L100-1, $Ultimate##0]true [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] 106#[L101, $Ultimate##0, $Ultimate##0]true [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] 146#[$Ultimate##0, L102, $Ultimate##0, $Ultimate##0]true [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] 190#[L103, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [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] 192#[L103, $Ultimate##0, L74-1, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:37:16,076 INFO L750 eck$LassoCheckResult]: Loop: 192#[L103, $Ultimate##0, L74-1, $Ultimate##0, $Ultimate##0]true [152] L74-1-->L74-1: Formula: (and (= v_array_max_18 (let ((.cse0 (select v_A_15 v_i4_15))) (ite (< v_array_max_19 .cse0) .cse0 v_array_max_19))) (= v_i4_14 (+ v_i4_15 1)) (< v_i4_15 v_N_8)) InVars {A=v_A_15, N=v_N_8, array_max=v_array_max_19, i4=v_i4_15} OutVars{A=v_A_15, N=v_N_8, array_max=v_array_max_18, i4=v_i4_14} AuxVars[] AssignedVars[array_max, i4] 192#[L103, $Ultimate##0, L74-1, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:37:16,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1335527326, now seen corresponding path program 1 times [2023-10-12 17:37:16,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874803552] [2023-10-12 17:37:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:16,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:16,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash 183, now seen corresponding path program 1 times [2023-10-12 17:37:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998421089] [2023-10-12 17:37:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:16,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1548325702, now seen corresponding path program 1 times [2023-10-12 17:37:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:16,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104687414] [2023-10-12 17:37:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:16,199 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:16,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:16,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:16,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:16,199 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:16,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:16,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:16,199 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:37:16,199 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:16,199 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:16,201 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,203 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,205 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,208 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,212 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,215 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,217 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,220 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:16,365 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:16,365 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:16,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,366 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:37:16,369 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 [2023-10-12 17:37:16,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,397 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:37:16,401 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 [2023-10-12 17:37:16,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,417 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:37:16,421 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 [2023-10-12 17:37:16,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,445 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:37:16,449 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 [2023-10-12 17:37:16,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,502 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:37:16,505 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 [2023-10-12 17:37:16,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,547 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:37:16,565 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 [2023-10-12 17:37:16,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:37:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,597 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:37:16,600 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 [2023-10-12 17:37:16,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:37:16,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,615 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:37:16,618 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 [2023-10-12 17:37:16,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,848 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:37:16,851 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 [2023-10-12 17:37:16,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,867 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:37:16,870 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 [2023-10-12 17:37:16,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:16,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,884 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:37:16,887 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 [2023-10-12 17:37:16,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:16,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:16,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:16,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:16,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:16,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:16,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:16,906 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:16,906 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:37:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:16,908 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:16,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:37:16,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:16,958 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:16,958 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:16,958 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i4) = 1*N - 1*i4 Supporting invariants [] [2023-10-12 17:37:16,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,964 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:16,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:16,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:16,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:17,008 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:17,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:17,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-10-12 17:37:17,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:17,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:17,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:37:17,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:17,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:37:17,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:17,094 INFO L430 stractBuchiCegarLoop]: Abstraction has has 56 places, 7424 transitions, 81152 flow [2023-10-12 17:37:17,094 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:37:17,094 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 56 places, 7424 transitions, 81152 flow [2023-10-12 17:37:17,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:17,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:17,857 ERROR L47 etriNetUnfolderRabin]: [1:1A:[161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max][7343], 2:2A:[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0][3759], 3:3A:[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][175], 10:4A:[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][2735], 21:5A:[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][943], 105:6A:[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][2479]][325:7A:[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][1455], 825:8A:[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][2991], 1654:9A:[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][1711], 1655:10A:[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][4271]] [2023-10-12 17:37:17,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:17,858 INFO L124 PetriNetUnfolderBase]: 1336/1654 cut-off events. [2023-10-12 17:37:17,858 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-10-12 17:37:17,858 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:17,859 INFO L748 eck$LassoCheckResult]: Stem: 60#[$Ultimate##0]true [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]true [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[L100-1, $Ultimate##0]true [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] 106#[L101, $Ultimate##0, $Ultimate##0]true [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] 146#[$Ultimate##0, L102, $Ultimate##0, $Ultimate##0]true [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] 190#[L103, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [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] 238#[$Ultimate##0, L104, $Ultimate##0, L84, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:37:17,859 INFO L750 eck$LassoCheckResult]: Loop: 238#[$Ultimate##0, L104, $Ultimate##0, L84, $Ultimate##0, $Ultimate##0]true [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] 241#[$Ultimate##0, $Ultimate##0, L104, L86, $Ultimate##0, $Ultimate##0]true [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] 243#[$Ultimate##0, L104, $Ultimate##0, L87, $Ultimate##0, $Ultimate##0]true [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] 245#[$Ultimate##0, $Ultimate##0, L104, L88, $Ultimate##0, $Ultimate##0]true [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] 238#[$Ultimate##0, L104, $Ultimate##0, L84, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:37:17,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1335527346, now seen corresponding path program 1 times [2023-10-12 17:37:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006084348] [2023-10-12 17:37:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:17,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:17,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:17,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 4864899, now seen corresponding path program 1 times [2023-10-12 17:37:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:17,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393321889] [2023-10-12 17:37:17,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:17,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:17,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:17,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:17,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1795654324, now seen corresponding path program 1 times [2023-10-12 17:37:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:17,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272003142] [2023-10-12 17:37:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:17,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:17,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:18,055 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:18 BoogieIcfgContainer [2023-10-12 17:37:18,055 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:18,055 INFO L158 Benchmark]: Toolchain (without parser) took 5181.30ms. Allocated memory was 196.1MB in the beginning and 333.4MB in the end (delta: 137.4MB). Free memory was 149.7MB in the beginning and 251.6MB in the end (delta: -101.9MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:18,056 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 196.1MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:18,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.24ms. Allocated memory is still 196.1MB. Free memory was 149.7MB in the beginning and 148.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:18,056 INFO L158 Benchmark]: Boogie Preprocessor took 13.35ms. Allocated memory is still 196.1MB. Free memory was 148.0MB in the beginning and 146.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:18,056 INFO L158 Benchmark]: RCFGBuilder took 226.16ms. Allocated memory is still 196.1MB. Free memory was 146.9MB in the beginning and 135.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:18,057 INFO L158 Benchmark]: BuchiAutomizer took 4920.60ms. Allocated memory was 196.1MB in the beginning and 333.4MB in the end (delta: 137.4MB). Free memory was 135.5MB in the beginning and 251.6MB in the end (delta: -116.1MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:18,058 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23ms. Allocated memory is still 196.1MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.24ms. Allocated memory is still 196.1MB. Free memory was 149.7MB in the beginning and 148.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.35ms. Allocated memory is still 196.1MB. Free memory was 148.0MB in the beginning and 146.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 226.16ms. Allocated memory is still 196.1MB. Free memory was 146.9MB in the beginning and 135.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 4920.60ms. Allocated memory was 196.1MB in the beginning and 333.4MB in the end (delta: 137.4MB). Free memory was 135.5MB in the beginning and 251.6MB in the end (delta: -116.1MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 3 locations. One deterministic module has affine ranking function -1 * i3 + k and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i4 and consists of 3 locations. The remainder module has 81152 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 384 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 268 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital66 mio100 ax100 hnf100 lsp108 ukn59 mio100 lsp56 div100 bol100 ite100 ukn100 eq176 hnf94 smp100 dnf146 smp64 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 125ms 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.2s - 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; [L97] 0 array_min := A[0]; [L98] 0 array_max := A[0]; VAL [N=0, array_max=9, array_min=9, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=9, array_min=9, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=9, array_min=9, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=9, array_min=9, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=9, array_min=9, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=9, array_min=9, 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; [L97] 0 array_min := A[0]; [L98] 0 array_max := A[0]; VAL [N=0, array_max=9, array_min=9, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=9, array_min=9, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=9, array_min=9, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=9, array_min=9, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=9, array_min=9, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=9, array_min=9, 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 563, independent: 545, independent conditional: 0, independent unconditional: 545, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 366, independent: 354, independent conditional: 0, independent unconditional: 354, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 366, independent: 354, independent conditional: 0, independent unconditional: 354, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 563, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 366, unknown conditional: 0, unknown unconditional: 366] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:37:18,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...