/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/min2-max2-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:13,231 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:13,461 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:13,478 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:13,479 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:13,479 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:13,480 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:13,480 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:13,481 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:13,481 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:13,481 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:13,482 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:13,482 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:13,482 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:13,483 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:13,483 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:13,483 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:13,483 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:13,484 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:13,484 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:13,484 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:13,485 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:13,485 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:13,485 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:13,485 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:13,486 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:13,486 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:13,486 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:13,486 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:13,487 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:13,487 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:13,487 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:13,487 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:13,488 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:13,489 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:13,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:13,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:13,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:13,759 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:13,760 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:13,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl [2023-10-12 17:37:13,761 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl' [2023-10-12 17:37:13,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:13,798 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:13,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:13,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:13,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:13,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,824 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:13,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:13,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:13,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:13,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:13,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:13,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:13,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:13,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:13,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/1) ... [2023-10-12 17:37:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:13,885 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:13,904 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:13,918 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:37:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:37:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:37:13,919 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:13,919 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:37:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:37:13,920 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:37:13,920 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:37:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:37:13,920 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:37:13,921 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,967 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:13,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:14,054 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:14,070 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:14,071 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:37:14,073 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:14 BoogieIcfgContainer [2023-10-12 17:37:14,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:14,074 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:14,074 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:14,080 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:14,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:14,081 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:13" (1/2) ... [2023-10-12 17:37:14,083 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53b5dec0 and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:14, skipping insertion in model container [2023-10-12 17:37:14,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:14,083 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:14" (2/2) ... [2023-10-12 17:37:14,084 INFO L332 chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl [2023-10-12 17:37:14,149 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:37:14,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 135 flow [2023-10-12 17:37:14,215 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2023-10-12 17:37:14,215 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:14,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 39 events. 5/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-10-12 17:37:14,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 135 flow [2023-10-12 17:37:14,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow [2023-10-12 17:37:14,247 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:14,260 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 105 flow [2023-10-12 17:37:14,262 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 105 flow [2023-10-12 17:37:14,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 105 flow [2023-10-12 17:37:14,274 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2023-10-12 17:37:14,274 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:14,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 39 events. 5/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-10-12 17:37:14,276 INFO L119 LiptonReduction]: Number of co-enabled transitions 810 [2023-10-12 17:37:14,393 INFO L134 LiptonReduction]: Checked pairs total: 1274 [2023-10-12 17:37:14,394 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:37:14,406 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:14,406 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:14,406 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:14,406 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:14,406 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:14,406 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:14,407 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:14,407 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:14,407 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 45 places, 34 transitions, 95 flow [2023-10-12 17:37:14,412 ERROR L47 etriNetUnfolderRabin]: [1:1A:[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0][23], 3:2A:[84] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min][20], 6:3A:[85] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1][19]][10:4A:[87] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[][22], 11:5A:[89] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1][7]] [2023-10-12 17:37:14,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:14,414 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-10-12 17:37:14,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:14,415 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:14,421 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:14,421 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 45 places, 34 transitions, 95 flow [2023-10-12 17:37:14,426 ERROR L47 etriNetUnfolderRabin]: [1:1A:[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0][23], 3:2A:[84] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min][20], 6:3A:[85] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1][19]][10:4A:[87] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[][22], 11:5A:[89] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1][7]] [2023-10-12 17:37:14,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:14,427 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-10-12 17:37:14,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:14,427 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:14,432 INFO L748 eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]true [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 61#[$Ultimate##0, L69]true [84] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min] 63#[L33, L69]true [85] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 65#[L36-1, L69]true [2023-10-12 17:37:14,432 INFO L750 eck$LassoCheckResult]: Loop: 65#[L36-1, L69]true [87] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[] 68#[L69, L36]true [89] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1] 65#[L36-1, L69]true [2023-10-12 17:37:14,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times [2023-10-12 17:37:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799107170] [2023-10-12 17:37:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2023-10-12 17:37:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212749946] [2023-10-12 17:37:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times [2023-10-12 17:37:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945868629] [2023-10-12 17:37:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,664 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:14,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:14,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:14,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:14,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:14,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:14,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:14,666 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:14,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:14,666 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:14,680 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,688 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,691 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,811 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:14,815 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,822 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,824 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,825 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,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:14,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:14,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:14,868 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,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,870 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,884 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,884 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,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:14,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:14,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:14,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:14,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:14,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,912 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,920 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,925 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,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,927 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:14,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,937 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:14,938 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:14,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:14,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:14,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,968 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,978 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,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:14,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:14,995 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:15,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:15,035 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:15,035 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:15,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,040 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:15,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:15,082 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:15,090 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:15,090 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:15,090 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i1) = 1*N - 1*i1 Supporting invariants [] [2023-10-12 17:37:15,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:37:15,096 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:15,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:15,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:15,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:15,160 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:15,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:15,182 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,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:37:15,351 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,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2023-10-12 17:37:15,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:15,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:15,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:15,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:15,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:37:15,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:15,451 INFO L430 stractBuchiCegarLoop]: Abstraction has has 51 places, 204 transitions, 978 flow [2023-10-12 17:37:15,451 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:15,451 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 51 places, 204 transitions, 978 flow [2023-10-12 17:37:15,469 ERROR L47 etriNetUnfolderRabin]: [1:1A:[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0][140], 2:2A:[101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1][62], 5:3A:[90] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min][38], 13:4A:[91] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1][26]][53:5A:[93] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[][74], 54:6A:[95] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1][56]] [2023-10-12 17:37:15,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:15,469 INFO L124 PetriNetUnfolderBase]: 30/53 cut-off events. [2023-10-12 17:37:15,469 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-10-12 17:37:15,469 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:15,470 INFO L748 eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]true [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 61#[$Ultimate##0, L69]true [101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1] 112#[$Ultimate##0, $Ultimate##0, L70]true [90] $Ultimate##0-->L33: Formula: (= v_array_min_6 0) InVars {} OutVars{array_min=v_array_min_6} AuxVars[] AssignedVars[array_min] 114#[$Ultimate##0, L33, L70]true [91] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 116#[$Ultimate##0, L36-1, L70]true [2023-10-12 17:37:15,470 INFO L750 eck$LassoCheckResult]: Loop: 116#[$Ultimate##0, L36-1, L70]true [93] L36-1-->L36: Formula: (< v_i1_2 v_N_3) InVars {i1=v_i1_2, N=v_N_3} OutVars{i1=v_i1_2, N=v_N_3} AuxVars[] AssignedVars[] 119#[L36, $Ultimate##0, L70]true [95] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0)))) InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8} OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7} AuxVars[] AssignedVars[array_min, i1] 116#[$Ultimate##0, L36-1, L70]true [2023-10-12 17:37:15,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash 3942981, now seen corresponding path program 1 times [2023-10-12 17:37:15,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927522130] [2023-10-12 17:37:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2023-10-12 17:37:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249205958] [2023-10-12 17:37:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times [2023-10-12 17:37:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64009369] [2023-10-12 17:37:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,586 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:15,587 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:15,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:15,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:15,587 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:15,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:15,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:15,587 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:15,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:15,588 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:15,589 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,591 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,593 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,596 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,598 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,635 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,747 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:15,747 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,749 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,759 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,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:15,767 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,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:15,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:15,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,784 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,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,786 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,800 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,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:15,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:15,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:15,812 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,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,827 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,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,829 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,832 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,833 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,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:15,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,869 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,880 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,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,889 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,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:15,911 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,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,916 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,919 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,920 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,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:15,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:15,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:15,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:15,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:15,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:15,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:15,949 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:15,949 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:15,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:15,951 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,954 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,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:15,989 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:15,990 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:15,990 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i1) = 1*N - 1*i1 Supporting invariants [] [2023-10-12 17:37:15,996 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,997 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:16,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:16,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:16,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:16,034 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:16,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:16,052 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:16,054 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:37:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2023-10-12 17:37:16,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:16,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:16,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:37:16,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:16,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:37:16,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:16,209 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 1224 transitions, 8316 flow [2023-10-12 17:37:16,209 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:16,209 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 57 places, 1224 transitions, 8316 flow [2023-10-12 17:37:16,274 ERROR L47 etriNetUnfolderRabin]: [1:1A:[98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0][842], 2:2A:[101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1][374], 8:3A:[104] L70-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork2_thidvar2_2 3) (= v_computeMaxThread1of1ForFork2_thidvar0_2 3) (= v_computeMaxThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{computeMaxThread1of1ForFork2_y=v_computeMaxThread1of1ForFork2_y_2, computeMaxThread1of1ForFork2_thidvar2=v_computeMaxThread1of1ForFork2_thidvar2_2, computeMaxThread1of1ForFork2_thidvar1=v_computeMaxThread1of1ForFork2_thidvar1_2, computeMaxThread1of1ForFork2_thidvar0=v_computeMaxThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork2_y, computeMaxThread1of1ForFork2_thidvar2, computeMaxThread1of1ForFork2_thidvar1, computeMaxThread1of1ForFork2_thidvar0][986], 12:4A:[107] L71-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork3_thidvar0_2 4) (= v_computeMaxThread1of1ForFork3_thidvar3_2 4) (= v_computeMaxThread1of1ForFork3_thidvar2_2 4) (= v_computeMaxThread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{computeMaxThread1of1ForFork3_thidvar3=v_computeMaxThread1of1ForFork3_thidvar3_2, computeMaxThread1of1ForFork3_y=v_computeMaxThread1of1ForFork3_y_2, computeMaxThread1of1ForFork3_thidvar1=v_computeMaxThread1of1ForFork3_thidvar1_2, computeMaxThread1of1ForFork3_thidvar2=v_computeMaxThread1of1ForFork3_thidvar2_2, computeMaxThread1of1ForFork3_thidvar0=v_computeMaxThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork3_thidvar3, computeMaxThread1of1ForFork3_y, computeMaxThread1of1ForFork3_thidvar1, computeMaxThread1of1ForFork3_thidvar2, computeMaxThread1of1ForFork3_thidvar0][122], 46:5A:[110] L72-->L60: Formula: (and (= 5 v_sampleThread1of1ForFork4_thidvar0_2) (= 5 v_sampleThread1of1ForFork4_thidvar1_2) (= 5 v_sampleThread1of1ForFork4_thidvar2_2) (= 5 v_sampleThread1of1ForFork4_thidvar4_2) (= 5 v_sampleThread1of1ForFork4_thidvar3_2)) InVars {} OutVars{sampleThread1of1ForFork4_thidvar4=v_sampleThread1of1ForFork4_thidvar4_2, sampleThread1of1ForFork4_thidvar3=v_sampleThread1of1ForFork4_thidvar3_2, sampleThread1of1ForFork4_thidvar2=v_sampleThread1of1ForFork4_thidvar2_2, sampleThread1of1ForFork4_thidvar1=v_sampleThread1of1ForFork4_thidvar1_2, sampleThread1of1ForFork4_thidvar0=v_sampleThread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[sampleThread1of1ForFork4_thidvar4, sampleThread1of1ForFork4_thidvar3, sampleThread1of1ForFork4_thidvar2, sampleThread1of1ForFork4_thidvar1, sampleThread1of1ForFork4_thidvar0][950]][136:6A:[82] L60-->L62: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples][626], 138:7A:[83] L62-->L60: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2} OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples][14]] [2023-10-12 17:37:16,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:16,275 INFO L124 PetriNetUnfolderBase]: 87/137 cut-off events. [2023-10-12 17:37:16,275 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-10-12 17:37:16,275 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:16,276 INFO L748 eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]true [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 61#[$Ultimate##0, L69]true [101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1] 112#[$Ultimate##0, $Ultimate##0, L70]true [104] L70-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork2_thidvar2_2 3) (= v_computeMaxThread1of1ForFork2_thidvar0_2 3) (= v_computeMaxThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{computeMaxThread1of1ForFork2_y=v_computeMaxThread1of1ForFork2_y_2, computeMaxThread1of1ForFork2_thidvar2=v_computeMaxThread1of1ForFork2_thidvar2_2, computeMaxThread1of1ForFork2_thidvar1=v_computeMaxThread1of1ForFork2_thidvar1_2, computeMaxThread1of1ForFork2_thidvar0=v_computeMaxThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork2_y, computeMaxThread1of1ForFork2_thidvar2, computeMaxThread1of1ForFork2_thidvar1, computeMaxThread1of1ForFork2_thidvar0] 160#[$Ultimate##0, L71, $Ultimate##0, $Ultimate##0]true [107] L71-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork3_thidvar0_2 4) (= v_computeMaxThread1of1ForFork3_thidvar3_2 4) (= v_computeMaxThread1of1ForFork3_thidvar2_2 4) (= v_computeMaxThread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{computeMaxThread1of1ForFork3_thidvar3=v_computeMaxThread1of1ForFork3_thidvar3_2, computeMaxThread1of1ForFork3_y=v_computeMaxThread1of1ForFork3_y_2, computeMaxThread1of1ForFork3_thidvar1=v_computeMaxThread1of1ForFork3_thidvar1_2, computeMaxThread1of1ForFork3_thidvar2=v_computeMaxThread1of1ForFork3_thidvar2_2, computeMaxThread1of1ForFork3_thidvar0=v_computeMaxThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork3_thidvar3, computeMaxThread1of1ForFork3_y, computeMaxThread1of1ForFork3_thidvar1, computeMaxThread1of1ForFork3_thidvar2, computeMaxThread1of1ForFork3_thidvar0] 162#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L72, $Ultimate##0]true [110] L72-->L60: Formula: (and (= 5 v_sampleThread1of1ForFork4_thidvar0_2) (= 5 v_sampleThread1of1ForFork4_thidvar1_2) (= 5 v_sampleThread1of1ForFork4_thidvar2_2) (= 5 v_sampleThread1of1ForFork4_thidvar4_2) (= 5 v_sampleThread1of1ForFork4_thidvar3_2)) InVars {} OutVars{sampleThread1of1ForFork4_thidvar4=v_sampleThread1of1ForFork4_thidvar4_2, sampleThread1of1ForFork4_thidvar3=v_sampleThread1of1ForFork4_thidvar3_2, sampleThread1of1ForFork4_thidvar2=v_sampleThread1of1ForFork4_thidvar2_2, sampleThread1of1ForFork4_thidvar1=v_sampleThread1of1ForFork4_thidvar1_2, sampleThread1of1ForFork4_thidvar0=v_sampleThread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[sampleThread1of1ForFork4_thidvar4, sampleThread1of1ForFork4_thidvar3, sampleThread1of1ForFork4_thidvar2, sampleThread1of1ForFork4_thidvar1, sampleThread1of1ForFork4_thidvar0] 164#[$Ultimate##0, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, L60]true [2023-10-12 17:37:16,276 INFO L750 eck$LassoCheckResult]: Loop: 164#[$Ultimate##0, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, L60]true [82] L60-->L62: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples] 167#[L62, $Ultimate##0, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0]true [83] L62-->L60: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2} OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples] 164#[$Ultimate##0, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, L60]true [2023-10-12 17:37:16,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash 122246471, now seen corresponding path program 1 times [2023-10-12 17:37:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365319206] [2023-10-12 17:37:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:16,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash 3586, now seen corresponding path program 1 times [2023-10-12 17:37:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:16,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393820501] [2023-10-12 17:37:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:16,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1514744264, now seen corresponding path program 1 times [2023-10-12 17:37:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634858428] [2023-10-12 17:37:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:16,531 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:16 BoogieIcfgContainer [2023-10-12 17:37:16,531 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:16,532 INFO L158 Benchmark]: Toolchain (without parser) took 2733.53ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 130.6MB in the beginning and 145.5MB in the end (delta: -14.9MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:16,532 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 176.2MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:16,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.98ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 129.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:16,538 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 176.2MB. Free memory was 129.0MB in the beginning and 127.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:16,539 INFO L158 Benchmark]: RCFGBuilder took 221.36ms. Allocated memory is still 176.2MB. Free memory was 127.8MB in the beginning and 118.1MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:16,540 INFO L158 Benchmark]: BuchiAutomizer took 2457.20ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 117.9MB in the beginning and 145.5MB in the end (delta: -27.6MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2023-10-12 17:37:16,546 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.25ms. Allocated memory is still 176.2MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.98ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 129.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 176.2MB. Free memory was 129.0MB in the beginning and 127.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 221.36ms. Allocated memory is still 176.2MB. Free memory was 127.8MB in the beginning and 118.1MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2457.20ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 117.9MB in the beginning and 145.5MB in the end (delta: -27.6MB). Peak memory consumption was 46.8MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. The remainder module has 8316 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.2s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 180 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital43 mio100 ax100 hnf100 lsp130 ukn53 mio100 lsp60 div100 bol100 ite100 ukn100 eq166 hnf100 smp100 dnf160 smp58 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 1 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: 60]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L69] FORK 0 fork 1 computeMin(); [L70] FORK 0 fork 2, 2 computeMin(); [L71] FORK 0 fork 3, 3, 3 computeMax(); [L72] FORK 0 fork 4, 4, 4, 4 computeMax(); [L73] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 60]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L69] FORK 0 fork 1 computeMin(); [L70] FORK 0 fork 2, 2 computeMin(); [L71] FORK 0 fork 3, 3, 3 computeMax(); [L72] FORK 0 fork 4, 4, 4, 4 computeMax(); [L73] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 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.1s, 50 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 34 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 562, independent: 518, independent conditional: 0, independent unconditional: 518, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 386, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 562, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 386, unknown conditional: 0, unknown unconditional: 386] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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:16,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:16,763 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...