/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:36:32,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:36:32,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:36:32,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:36:32,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:36:32,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:36:32,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:36:32,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:36:32,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:36:32,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:36:32,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:36:32,078 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:36:32,078 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:36:32,078 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:36:32,079 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:36:32,079 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:36:32,079 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:36:32,079 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:36:32,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:36:32,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:36:32,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:36:32,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:36:32,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:36:32,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:36:32,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:36:32,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:36:32,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:36:32,084 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:36:32,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:36:32,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:36:32,085 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:36:32,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:36:32,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:36:32,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:36:32,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:36:32,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:36:32,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:36:32,087 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:36:32,087 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:36:32,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:36:32,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:36:32,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:36:32,371 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:36:32,372 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:36:32,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl [2024-02-10 01:36:32,374 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl' [2024-02-10 01:36:32,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:36:32,407 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:36:32,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:32,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:36:32,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:36:32,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,438 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:36:32,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:36:32,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:36:32,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:36:32,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:36:32,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:36:32,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:36:32,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:36:32,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:36:32,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/1) ... [2024-02-10 01:36:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:36:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:36:32,562 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) [2024-02-10 01:36:32,595 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 [2024-02-10 01:36:32,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:36:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:36:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:36:32,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:36:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:36:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:36:32,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:36:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:36:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:36:32,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:36:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:36:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:36:32,624 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:36:32,672 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:36:32,674 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:36:32,768 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:36:32,780 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:36:32,780 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 01:36:32,782 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:32 BoogieIcfgContainer [2024-02-10 01:36:32,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:36:32,784 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:36:32,784 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:36:32,787 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:36:32,788 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:32,788 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:36:32" (1/2) ... [2024-02-10 01:36:32,792 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7939750 and model type min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:36:32, skipping insertion in model container [2024-02-10 01:36:32,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:36:32,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:36:32" (2/2) ... [2024-02-10 01:36:32,794 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample.bpl [2024-02-10 01:36:32,857 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:36:32,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 76 flow [2024-02-10 01:36:32,906 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2024-02-10 01:36:32,906 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:36:32,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-02-10 01:36:32,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 76 flow [2024-02-10 01:36:32,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 61 flow [2024-02-10 01:36:32,922 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:36:32,922 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:36:32,922 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:36:32,922 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:36:32,923 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:36:32,923 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:36:32,923 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:36:32,924 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:36:32,924 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:32,924 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 61 flow [2024-02-10 01:36:32,958 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 181 states, 179 states have (on average 2.921787709497207) internal successors, (523), 180 states have internal predecessors, (523), 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) [2024-02-10 01:36:32,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 181 states, 179 states have (on average 2.921787709497207) internal successors, (523), 180 states have internal predecessors, (523), 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) [2024-02-10 01:36:32,996 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 136 [2024-02-10 01:36:32,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:32,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:32,999 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:36:32,999 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:36:32,999 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 61 flow [2024-02-10 01:36:33,008 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 181 states, 179 states have (on average 2.921787709497207) internal successors, (523), 180 states have internal predecessors, (523), 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) [2024-02-10 01:36:33,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 181 states, 179 states have (on average 2.921787709497207) internal successors, (523), 180 states have internal predecessors, (523), 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) [2024-02-10 01:36:33,018 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 136 [2024-02-10 01:36:33,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:36:33,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:36:33,022 INFO L748 eck$LassoCheckResult]: Stem: Black: 400#[$Ultimate##0]don't care [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 403#[L68, $Ultimate##0]don't care [81] L68-->$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] 405#[$Ultimate##0, $Ultimate##0, L69]don't care [84] L69-->L59: 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] 411#[L70, L59, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 01:36:33,023 INFO L750 eck$LassoCheckResult]: Loop: 411#[L70, L59, $Ultimate##0, $Ultimate##0]don't care [68] L59-->L61: 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] 425#[$Ultimate##0, L61, $Ultimate##0, L70]don't care [69] L61-->L59: 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] 411#[L70, L59, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 01:36:33,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 107344, now seen corresponding path program 1 times [2024-02-10 01:36:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153053470] [2024-02-10 01:36:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:33,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 3138, now seen corresponding path program 1 times [2024-02-10 01:36:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:33,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537607496] [2024-02-10 01:36:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:33,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:36:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 103159761, now seen corresponding path program 1 times [2024-02-10 01:36:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:36:33,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308190195] [2024-02-10 01:36:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:36:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:36:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:36:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:36:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:36:33,306 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:36:33 BoogieIcfgContainer [2024-02-10 01:36:33,306 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:36:33,309 INFO L158 Benchmark]: Toolchain (without parser) took 900.16ms. Allocated memory is still 194.0MB. Free memory was 131.7MB in the beginning and 129.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.2MB. Max. memory is 8.0GB. [2024-02-10 01:36:33,309 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.77ms. Allocated memory is still 194.0MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:36:33,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.74ms. Allocated memory is still 194.0MB. Free memory was 131.5MB in the beginning and 129.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:36:33,311 INFO L158 Benchmark]: Boogie Preprocessor took 73.37ms. Allocated memory is still 194.0MB. Free memory was 129.9MB in the beginning and 169.5MB in the end (delta: -39.6MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. [2024-02-10 01:36:33,312 INFO L158 Benchmark]: RCFGBuilder took 265.26ms. Allocated memory is still 194.0MB. Free memory was 169.5MB in the beginning and 159.0MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:36:33,312 INFO L158 Benchmark]: BuchiAutomizer took 522.65ms. Allocated memory is still 194.0MB. Free memory was 159.0MB in the beginning and 129.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-02-10 01:36:33,313 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.77ms. Allocated memory is still 194.0MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.74ms. Allocated memory is still 194.0MB. Free memory was 131.5MB in the beginning and 129.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.37ms. Allocated memory is still 194.0MB. Free memory was 129.9MB in the beginning and 169.5MB in the end (delta: -39.6MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. * RCFGBuilder took 265.26ms. Allocated memory is still 194.0MB. Free memory was 169.5MB in the beginning and 159.0MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 522.65ms. Allocated memory is still 194.0MB. Free memory was 159.0MB in the beginning and 129.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. 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.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 59]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L68] FORK 0 fork 1 computeMin(); [L69] FORK 0 fork 2, 2 computeMax(); [L70] FORK 0 fork 3, 3, 3 sample(); Loop: [L60] min_samples[i1 - 1] := array_min; [L61] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 59]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L68] FORK 0 fork 1 computeMin(); [L69] FORK 0 fork 2, 2 computeMax(); [L70] FORK 0 fork 3, 3, 3 sample(); Loop: [L60] min_samples[i1 - 1] := array_min; [L61] max_samples[i2 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:36:33,338 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...