/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 BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:59,856 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:59,893 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:18:59,909 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:59,909 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:59,910 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:59,911 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:59,911 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:59,911 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:59,911 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:59,911 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:59,912 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:59,912 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:59,912 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:59,912 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:59,913 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:59,913 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:59,913 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:59,913 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:59,914 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:59,914 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:59,914 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:59,914 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:59,915 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:59,915 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:59,915 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:59,915 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:59,915 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:59,915 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:59,916 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:59,916 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:59,916 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:59,916 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:59,917 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:59,917 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 -> BUCHI_PETRI_NET [2023-10-12 17:19:00,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:19:00,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:19:00,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:19:00,086 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:19:00,087 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:19:00,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl [2023-10-12 17:19:00,088 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-2.bpl' [2023-10-12 17:19:00,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:19:00,113 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:19:00,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:00,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:19:00,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:19:00,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,136 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:19:00,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:00,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:19:00,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:19:00,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:19:00,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:19:00,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:19:00,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:19:00,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:19:00,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/1) ... [2023-10-12 17:19:00,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,178 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:19:00,195 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:19:00,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:19:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:19:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:19:00,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:19:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:19:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:19:00,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:19:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:19:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:19:00,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:19:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:19:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:19:00,207 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:19:00,246 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:19:00,247 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:19:00,338 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:19:00,342 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:19:00,343 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:19:00,344 INFO L201 PluginConnector]: Adding new model min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:00 BoogieIcfgContainer [2023-10-12 17:19:00,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:19:00,345 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:19:00,345 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:19:00,348 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:19:00,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:00,348 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:00" (1/2) ... [2023-10-12 17:19:00,349 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c237ee6 and model type min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:19:00, skipping insertion in model container [2023-10-12 17:19:00,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:00,349 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:00" (2/2) ... [2023-10-12 17:19:00,350 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-2.bpl [2023-10-12 17:19:00,410 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:19:00,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2023-10-12 17:19:00,483 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:19:00,484 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:19:00,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:19:00,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2023-10-12 17:19:00,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 67 flow [2023-10-12 17:19:00,492 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:19:00,501 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 67 flow [2023-10-12 17:19:00,503 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 67 flow [2023-10-12 17:19:00,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 67 flow [2023-10-12 17:19:00,509 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:19:00,509 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:19:00,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:19:00,510 INFO L119 LiptonReduction]: Number of co-enabled transitions 268 [2023-10-12 17:19:00,645 INFO L134 LiptonReduction]: Checked pairs total: 289 [2023-10-12 17:19:00,645 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:19:00,655 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:19:00,656 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:19:00,656 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:19:00,656 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:19:00,656 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:19:00,656 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:19:00,656 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:19:00,656 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:19:00,657 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 places, 21 transitions, 57 flow [2023-10-12 17:19:00,661 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:00,661 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-10-12 17:19:00,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:00,661 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:00,663 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:19:00,663 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 places, 21 transitions, 57 flow [2023-10-12 17:19:00,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:00,665 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-10-12 17:19:00,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:00,665 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:00,669 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [56] $Ultimate##0-->L70: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[] 42#[L70]true [82] L70-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 44#[L70-1, $Ultimate##0]true [85] L70-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 46#[$Ultimate##0, $Ultimate##0, L71]true [88] L71-->L57: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_thidvar1] 48#[$Ultimate##0, L57, $Ultimate##0, L72]true [2023-10-12 17:19:00,669 INFO L750 eck$LassoCheckResult]: Loop: 48#[$Ultimate##0, L57, $Ultimate##0, L72]true [71] L57-->L59: 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] 51#[$Ultimate##0, $Ultimate##0, L59, L72]true [72] L59-->L57: 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] 48#[$Ultimate##0, L57, $Ultimate##0, L72]true [2023-10-12 17:19:00,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2673342, now seen corresponding path program 1 times [2023-10-12 17:19:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:00,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487955146] [2023-10-12 17:19:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:00,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash 3234, now seen corresponding path program 1 times [2023-10-12 17:19:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706880732] [2023-10-12 17:19:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:00,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1725883361, now seen corresponding path program 1 times [2023-10-12 17:19:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199893881] [2023-10-12 17:19:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:00,915 INFO L201 PluginConnector]: Adding new model min-max-sample-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:19:00 BoogieIcfgContainer [2023-10-12 17:19:00,915 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:19:00,916 INFO L158 Benchmark]: Toolchain (without parser) took 802.70ms. Allocated memory is still 243.3MB. Free memory was 194.9MB in the beginning and 184.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2023-10-12 17:19:00,916 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 243.3MB. Free memory is still 196.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:00,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.39ms. Allocated memory is still 243.3MB. Free memory was 194.9MB in the beginning and 193.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:19:00,917 INFO L158 Benchmark]: Boogie Preprocessor took 16.21ms. Allocated memory is still 243.3MB. Free memory was 193.3MB in the beginning and 192.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:00,918 INFO L158 Benchmark]: RCFGBuilder took 188.16ms. Allocated memory is still 243.3MB. Free memory was 192.1MB in the beginning and 182.4MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:19:00,918 INFO L158 Benchmark]: BuchiAutomizer took 570.09ms. Allocated memory is still 243.3MB. Free memory was 182.3MB in the beginning and 184.4MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:00,920 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.20ms. Allocated memory is still 243.3MB. Free memory is still 196.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.39ms. Allocated memory is still 243.3MB. Free memory was 194.9MB in the beginning and 193.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.21ms. Allocated memory is still 243.3MB. Free memory was 193.3MB in the beginning and 192.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 188.16ms. Allocated memory is still 243.3MB. Free memory was 192.1MB in the beginning and 182.4MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 570.09ms. Allocated memory is still 243.3MB. Free memory was 182.3MB in the beginning and 184.4MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 1 iterations. TraceHistogramMax:0. Analysis of lassos took 0.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 57]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L68] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L70] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L71] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L72] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L58] min_samples[i1 - 1] := array_min; [L59] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 57]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L68] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L70] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L71] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L72] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L58] min_samples[i1 - 1] := array_min; [L59] 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, 33 PlacesBefore, 28 PlacesAfterwards, 26 TransitionsBefore, 21 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 119, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 119, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 119, unknown conditional: 0, unknown unconditional: 119] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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:19:00,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...