/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 true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:01:33,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:01:33,699 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:01:33,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:01:33,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:01:33,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:01:33,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:01:33,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:01:33,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:01:33,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:01:33,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:01:33,769 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:01:33,769 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:01:33,770 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:01:33,771 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:01:33,771 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:01:33,771 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:01:33,772 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:01:33,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:01:33,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:01:33,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:01:33,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:01:33,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:01:33,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:01:33,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:01:33,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:01:33,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:01:33,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:01:33,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:01:33,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:01:33,777 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:01:33,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:01:33,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:01:33,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:01:33,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:01:33,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:01:33,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:01:33,779 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:01:33,779 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:01:34,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:01:34,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:01:34,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:01:34,220 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:01:34,222 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:01:34,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl [2024-02-10 01:01:34,223 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl' [2024-02-10 01:01:34,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:01:34,255 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:01:34,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:01:34,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:01:34,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:01:34,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,338 INFO L138 Inliner]: procedures = 8, calls = 11, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 37 [2024-02-10 01:01:34,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:01:34,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:01:34,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:01:34,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:01:34,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:01:34,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:01:34,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:01:34,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:01:34,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/1) ... [2024-02-10 01:01:34,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:34,443 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:01:34,456 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:01:34,496 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:01:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:01:34,496 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:01:34,496 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:01:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:01:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:01:34,497 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:01:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:01:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:01:34,497 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:01:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:01:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:01:34,498 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:01:34,555 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:01:34,557 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:01:34,676 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:01:34,694 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:01:34,694 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 01:01:34,697 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:01:34 BoogieIcfgContainer [2024-02-10 01:01:34,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:01:34,699 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:01:34,699 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:01:34,704 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:01:34,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:01:34,705 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:34" (1/2) ... [2024-02-10 01:01:34,710 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c5bc85c and model type min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:01:34, skipping insertion in model container [2024-02-10 01:01:34,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:01:34,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:01:34" (2/2) ... [2024-02-10 01:01:34,712 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-with_locks.bpl [2024-02-10 01:01:34,775 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:01:34,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 106 flow [2024-02-10 01:01:34,823 INFO L124 PetriNetUnfolderBase]: 3/38 cut-off events. [2024-02-10 01:01:34,823 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:01:34,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 3/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-02-10 01:01:34,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 106 flow [2024-02-10 01:01:34,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 38 transitions, 91 flow [2024-02-10 01:01:34,842 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:01:34,842 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:01:34,842 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:01:34,843 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:01:34,843 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:01:34,843 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:01:34,843 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:01:34,843 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:01:34,844 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 38 transitions, 91 flow [2024-02-10 01:01:34,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:34,856 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-02-10 01:01:34,856 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:01:34,856 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:34,860 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:01:34,861 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 38 transitions, 91 flow [2024-02-10 01:01:34,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:34,868 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-02-10 01:01:34,869 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:01:34,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:34,874 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 54#[$Ultimate##0, L74]true [123] $Ultimate##0-->L33: Formula: (= (select v_A_4 0) v_array_min_6) InVars {A=v_A_4} OutVars{A=v_A_4, array_min=v_array_min_6} AuxVars[] AssignedVars[array_min] 56#[L33, L74]true [124] L33-->L35-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 58#[L74, L35-1]true [2024-02-10 01:01:34,875 INFO L750 eck$LassoCheckResult]: Loop: 58#[L74, L35-1]true [126] L35-1-->L86: 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[] 61#[L86, L74]true [128] L86-->L86-1: Formula: (and v_min_lock_7 (not v_min_lock_8)) InVars {min_lock=v_min_lock_8} OutVars{min_lock=v_min_lock_7} AuxVars[] AssignedVars[min_lock] 63#[L86-1, L74]true [129] L86-1-->L38: Formula: (= v_array_min_4 (let ((.cse0 (select v_A_3 v_i1_3))) (ite (< v_array_min_5 .cse0) v_array_min_5 .cse0))) InVars {A=v_A_3, i1=v_i1_3, array_min=v_array_min_5} OutVars{A=v_A_3, i1=v_i1_3, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min] 65#[L74, L38]true [130] L38-->L94: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1] 67#[L94, L74]true [131] L94-->L91: Formula: (not v_min_lock_6) InVars {} OutVars{min_lock=v_min_lock_6} AuxVars[] AssignedVars[min_lock] 69#[L74, L91]true [132] L91-->L35-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 58#[L74, L35-1]true [2024-02-10 01:01:34,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash 163463, now seen corresponding path program 1 times [2024-02-10 01:01:34,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:34,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007506997] [2024-02-10 01:01:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:34,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:34,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:34,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:34,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash 321992261, now seen corresponding path program 1 times [2024-02-10 01:01:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:35,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922551258] [2024-02-10 01:01:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:35,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:35,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:35,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1956628405, now seen corresponding path program 1 times [2024-02-10 01:01:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550060932] [2024-02-10 01:01:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:35,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:35,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:35,259 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:01:35,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:01:35,263 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:01:35,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:01:35,263 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:01:35,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:35,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:01:35,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:01:35,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-with_locks.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:01:35,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:01:35,264 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:01:35,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:35,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:35,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:35,539 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:01:35,542 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:01:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:35,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:35,545 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) [2024-02-10 01:01:35,548 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 [2024-02-10 01:01:35,558 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 [2024-02-10 01:01:35,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:35,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:35,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:35,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:35,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:35,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:35,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:35,593 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 [2024-02-10 01:01:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:35,601 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) [2024-02-10 01:01:35,604 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 [2024-02-10 01:01:35,605 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 [2024-02-10 01:01:35,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:35,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:35,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:35,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:35,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:35,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:35,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:01:35,644 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:01:35,644 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:01:35,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:35,652 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) [2024-02-10 01:01:35,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:01:35,667 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 [2024-02-10 01:01:35,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:01:35,686 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:01:35,687 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 01:01:35,696 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 [2024-02-10 01:01:35,700 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:01:35,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:35,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:01:35,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:35,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:01:35,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:35,905 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 [2024-02-10 01:01:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:01:35,963 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:01:35,967 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:01:36,218 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Result 9 states and 561 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:01:36,219 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:01:36,220 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:01:36,221 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:01:36,251 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:01:36,252 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:01:36,256 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 [2024-02-10 01:01:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:01:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-02-10 01:01:36,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 217 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 01:01:36,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:36,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 217 transitions. Stem has 9 letters. Loop has 6 letters. [2024-02-10 01:01:36,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:36,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 217 transitions. Stem has 3 letters. Loop has 12 letters. [2024-02-10 01:01:36,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:36,269 INFO L428 stractBuchiCegarLoop]: Abstraction has has 54 places, 483 transitions, 2127 flow [2024-02-10 01:01:36,269 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:01:36,270 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 places, 483 transitions, 2127 flow [2024-02-10 01:01:36,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:36,627 INFO L124 PetriNetUnfolderBase]: 1544/2002 cut-off events. [2024-02-10 01:01:36,627 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-02-10 01:01:36,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:36,629 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 54#[$Ultimate##0, L74]true [138] L74-->$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] 138#[$Ultimate##0, L75, $Ultimate##0]true [103] $Ultimate##0-->L47: Formula: (= (select v_A_1 0) v_array_max_1) InVars {A=v_A_1} OutVars{A=v_A_1, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 140#[$Ultimate##0, L75, L47]true [104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2] 142#[$Ultimate##0, L75, L49-1]true [106] L49-1-->L100: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[] 144#[L100, $Ultimate##0, L75]true [108] L100-->L100-1: Formula: (and v_max_lock_7 (not v_max_lock_8)) InVars {max_lock=v_max_lock_8} OutVars{max_lock=v_max_lock_7} AuxVars[] AssignedVars[max_lock] 146#[L100-1, $Ultimate##0, L75]true [109] L100-1-->L52: Formula: (= (let ((.cse0 (select v_A_2 v_i2_3))) (ite (< v_array_max_3 .cse0) .cse0 v_array_max_3)) v_array_max_2) InVars {A=v_A_2, i2=v_i2_3, array_max=v_array_max_3} OutVars{A=v_A_2, i2=v_i2_3, array_max=v_array_max_2} AuxVars[] AssignedVars[array_max] 148#[$Ultimate##0, L75, L52]true [110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2] 150#[$Ultimate##0, L75, L108]true [111] L108-->L105: Formula: (not v_max_lock_3) InVars {} OutVars{max_lock=v_max_lock_3} AuxVars[] AssignedVars[max_lock] 152#[$Ultimate##0, L75, L105]true [112] L105-->L49-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 142#[$Ultimate##0, L75, L49-1]true [2024-02-10 01:01:36,629 INFO L750 eck$LassoCheckResult]: Loop: 142#[$Ultimate##0, L75, L49-1]true [106] L49-1-->L100: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[] 144#[L100, $Ultimate##0, L75]true [108] L100-->L100-1: Formula: (and v_max_lock_7 (not v_max_lock_8)) InVars {max_lock=v_max_lock_8} OutVars{max_lock=v_max_lock_7} AuxVars[] AssignedVars[max_lock] 146#[L100-1, $Ultimate##0, L75]true [109] L100-1-->L52: Formula: (= (let ((.cse0 (select v_A_2 v_i2_3))) (ite (< v_array_max_3 .cse0) .cse0 v_array_max_3)) v_array_max_2) InVars {A=v_A_2, i2=v_i2_3, array_max=v_array_max_3} OutVars{A=v_A_2, i2=v_i2_3, array_max=v_array_max_2} AuxVars[] AssignedVars[array_max] 148#[$Ultimate##0, L75, L52]true [110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2] 150#[$Ultimate##0, L75, L108]true [111] L108-->L105: Formula: (not v_max_lock_3) InVars {} OutVars{max_lock=v_max_lock_3} AuxVars[] AssignedVars[max_lock] 152#[$Ultimate##0, L75, L105]true [112] L105-->L49-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 142#[$Ultimate##0, L75, L49-1]true [2024-02-10 01:01:36,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1487610953, now seen corresponding path program 1 times [2024-02-10 01:01:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321782845] [2024-02-10 01:01:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:36,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:36,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:36,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash -269676859, now seen corresponding path program 1 times [2024-02-10 01:01:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551386266] [2024-02-10 01:01:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:36,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:36,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:36,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash 493739277, now seen corresponding path program 2 times [2024-02-10 01:01:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876317201] [2024-02-10 01:01:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:36,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:36,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:36,819 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:01:36,819 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:01:36,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:01:36,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:01:36,820 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:01:36,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:36,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:01:36,820 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:01:36,820 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-with_locks.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:01:36,820 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:01:36,820 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:01:36,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:36,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:36,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:36,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:36,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:01:36,995 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:01:36,995 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:01:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:37,001 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) [2024-02-10 01:01:37,012 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 [2024-02-10 01:01:37,024 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 [2024-02-10 01:01:37,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:37,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:37,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:37,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:37,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:37,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:37,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:37,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:01:37,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:37,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:37,050 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) [2024-02-10 01:01:37,056 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 [2024-02-10 01:01:37,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:37,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:37,067 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:01:37,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:37,077 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 01:01:37,077 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:01:37,081 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 [2024-02-10 01:01:37,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:37,119 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 [2024-02-10 01:01:37,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:37,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:37,121 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) [2024-02-10 01:01:37,125 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 [2024-02-10 01:01:37,126 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 [2024-02-10 01:01:37,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:37,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:37,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:37,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:37,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:37,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:37,154 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:01:37,162 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:01:37,163 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:01:37,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:37,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:37,165 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) [2024-02-10 01:01:37,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:01:37,173 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 [2024-02-10 01:01:37,193 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:01:37,194 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:01:37,194 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-10 01:01:37,202 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 [2024-02-10 01:01:37,203 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:01:37,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:37,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:01:37,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:37,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:01:37,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:01:37,293 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:01:37,293 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:01:37,397 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Result 9 states and 561 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:01:37,397 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:01:37,397 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:01:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 561 transitions. [2024-02-10 01:01:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 561 transitions. [2024-02-10 01:01:37,415 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:01:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 561 transitions. [2024-02-10 01:01:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 561 transitions. [2024-02-10 01:01:37,468 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 [2024-02-10 01:01:37,725 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:01:37,725 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:01:37,726 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 [2024-02-10 01:01:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:01:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-02-10 01:01:37,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 217 transitions. Stem has 10 letters. Loop has 6 letters. [2024-02-10 01:01:37,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:37,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 217 transitions. Stem has 16 letters. Loop has 6 letters. [2024-02-10 01:01:37,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:37,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 217 transitions. Stem has 10 letters. Loop has 12 letters. [2024-02-10 01:01:37,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:37,731 INFO L428 stractBuchiCegarLoop]: Abstraction has has 67 places, 8003 transitions, 51333 flow [2024-02-10 01:01:37,731 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:01:37,731 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 67 places, 8003 transitions, 51333 flow [2024-02-10 01:02:18,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:18,067 INFO L124 PetriNetUnfolderBase]: 41376/49591 cut-off events. [2024-02-10 01:02:18,067 INFO L125 PetriNetUnfolderBase]: For 2414/2414 co-relation queries the response was YES. [2024-02-10 01:02:18,067 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:18,072 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 54#[$Ultimate##0, L74]true [138] L74-->$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] 138#[$Ultimate##0, L75, $Ultimate##0]true [103] $Ultimate##0-->L47: Formula: (= (select v_A_1 0) v_array_max_1) InVars {A=v_A_1} OutVars{A=v_A_1, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 140#[$Ultimate##0, L75, L47]true [104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2] 142#[$Ultimate##0, L75, L49-1]true [106] L49-1-->L100: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[] 144#[L100, $Ultimate##0, L75]true [141] L75-->L60: 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] 246#[L100, $Ultimate##0, L60, L76]true [114] L60-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 248#[L100, $Ultimate##0, L86, L76]true [115] L86-->L86-1: Formula: (and (not v_min_lock_12) v_min_lock_11) InVars {min_lock=v_min_lock_12} OutVars{min_lock=v_min_lock_11} AuxVars[] AssignedVars[min_lock] 250#[L100, $Ultimate##0, L76, L86-1]true [116] L86-1-->L94: 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] 252#[L94, L100, $Ultimate##0, L76]true [108] L100-->L100-1: Formula: (and v_max_lock_7 (not v_max_lock_8)) InVars {max_lock=v_max_lock_8} OutVars{max_lock=v_max_lock_7} AuxVars[] AssignedVars[max_lock] 254#[L94, L100-1, $Ultimate##0, L76]true [109] L100-1-->L52: Formula: (= (let ((.cse0 (select v_A_2 v_i2_3))) (ite (< v_array_max_3 .cse0) .cse0 v_array_max_3)) v_array_max_2) InVars {A=v_A_2, i2=v_i2_3, array_max=v_array_max_3} OutVars{A=v_A_2, i2=v_i2_3, array_max=v_array_max_2} AuxVars[] AssignedVars[array_max] 256#[L94, $Ultimate##0, L52, L76]true [110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2] 258#[L94, $Ultimate##0, L108, L76]true [111] L108-->L105: Formula: (not v_max_lock_3) InVars {} OutVars{max_lock=v_max_lock_3} AuxVars[] AssignedVars[max_lock] 260#[L94, $Ultimate##0, L105, L76]true [112] L105-->L49-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 262#[L94, $Ultimate##0, L49-1, L76]true [117] L94-->L91: Formula: (not v_min_lock_1) InVars {} OutVars{min_lock=v_min_lock_1} AuxVars[] AssignedVars[min_lock] 264#[$Ultimate##0, L49-1, L91, L76]true [118] L91-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[L100, $Ultimate##0, L49-1, L76]true [119] L100-->L100-1: Formula: (and v_max_lock_11 (not v_max_lock_12)) InVars {max_lock=v_max_lock_12} OutVars{max_lock=v_max_lock_11} AuxVars[] AssignedVars[max_lock] 268#[$Ultimate##0, L49-1, L100-1, L76]true [120] L100-1-->L108: 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] 270#[$Ultimate##0, L49-1, L108, L76]true [121] L108-->L105: Formula: (not v_max_lock_6) InVars {} OutVars{max_lock=v_max_lock_6} AuxVars[] AssignedVars[max_lock] 272#[L105, $Ultimate##0, L49-1, L76]true [122] L105-->L60: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 274#[$Ultimate##0, L49-1, L60, L76]true [2024-02-10 01:02:18,073 INFO L750 eck$LassoCheckResult]: Loop: 274#[$Ultimate##0, L49-1, L60, L76]true [114] L60-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 277#[$Ultimate##0, L49-1, L86, L76]true [115] L86-->L86-1: Formula: (and (not v_min_lock_12) v_min_lock_11) InVars {min_lock=v_min_lock_12} OutVars{min_lock=v_min_lock_11} AuxVars[] AssignedVars[min_lock] 279#[$Ultimate##0, L49-1, L76, L86-1]true [116] L86-1-->L94: 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] 262#[L94, $Ultimate##0, L49-1, L76]true [117] L94-->L91: Formula: (not v_min_lock_1) InVars {} OutVars{min_lock=v_min_lock_1} AuxVars[] AssignedVars[min_lock] 264#[$Ultimate##0, L49-1, L91, L76]true [118] L91-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[L100, $Ultimate##0, L49-1, L76]true [119] L100-->L100-1: Formula: (and v_max_lock_11 (not v_max_lock_12)) InVars {max_lock=v_max_lock_12} OutVars{max_lock=v_max_lock_11} AuxVars[] AssignedVars[max_lock] 268#[$Ultimate##0, L49-1, L100-1, L76]true [120] L100-1-->L108: 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] 270#[$Ultimate##0, L49-1, L108, L76]true [121] L108-->L105: Formula: (not v_max_lock_6) InVars {} OutVars{max_lock=v_max_lock_6} AuxVars[] AssignedVars[max_lock] 272#[L105, $Ultimate##0, L49-1, L76]true [122] L105-->L60: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 274#[$Ultimate##0, L49-1, L60, L76]true [114] L60-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 277#[$Ultimate##0, L49-1, L86, L76]true [115] L86-->L86-1: Formula: (and (not v_min_lock_12) v_min_lock_11) InVars {min_lock=v_min_lock_12} OutVars{min_lock=v_min_lock_11} AuxVars[] AssignedVars[min_lock] 279#[$Ultimate##0, L49-1, L76, L86-1]true [116] L86-1-->L94: 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] 262#[L94, $Ultimate##0, L49-1, L76]true [117] L94-->L91: Formula: (not v_min_lock_1) InVars {} OutVars{min_lock=v_min_lock_1} AuxVars[] AssignedVars[min_lock] 264#[$Ultimate##0, L49-1, L91, L76]true [118] L91-->L100: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[L100, $Ultimate##0, L49-1, L76]true [119] L100-->L100-1: Formula: (and v_max_lock_11 (not v_max_lock_12)) InVars {max_lock=v_max_lock_12} OutVars{max_lock=v_max_lock_11} AuxVars[] AssignedVars[max_lock] 268#[$Ultimate##0, L49-1, L100-1, L76]true [120] L100-1-->L108: 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] 270#[$Ultimate##0, L49-1, L108, L76]true [121] L108-->L105: Formula: (not v_max_lock_6) InVars {} OutVars{max_lock=v_max_lock_6} AuxVars[] AssignedVars[max_lock] 272#[L105, $Ultimate##0, L49-1, L76]true [122] L105-->L60: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 274#[$Ultimate##0, L49-1, L60, L76]true [2024-02-10 01:02:18,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1916908154, now seen corresponding path program 1 times [2024-02-10 01:02:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:18,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193645688] [2024-02-10 01:02:18,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:18,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:18,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1289619839, now seen corresponding path program 1 times [2024-02-10 01:02:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440874498] [2024-02-10 01:02:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:18,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1504981818, now seen corresponding path program 2 times [2024-02-10 01:02:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099699011] [2024-02-10 01:02:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:18,547 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:02:18 BoogieIcfgContainer [2024-02-10 01:02:18,548 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:02:18,549 INFO L158 Benchmark]: Toolchain (without parser) took 44293.37ms. Allocated memory was 170.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 107.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-02-10 01:02:18,549 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 170.9MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:02:18,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.97ms. Allocated memory is still 170.9MB. Free memory was 106.8MB in the beginning and 140.8MB in the end (delta: -34.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2024-02-10 01:02:18,550 INFO L158 Benchmark]: Boogie Preprocessor took 35.56ms. Allocated memory is still 170.9MB. Free memory was 140.8MB in the beginning and 139.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:02:18,551 INFO L158 Benchmark]: RCFGBuilder took 300.08ms. Allocated memory is still 170.9MB. Free memory was 139.7MB in the beginning and 129.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:02:18,552 INFO L158 Benchmark]: BuchiAutomizer took 43848.53ms. Allocated memory was 170.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 129.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 01:02:18,554 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.16ms. Allocated memory is still 170.9MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.97ms. Allocated memory is still 170.9MB. Free memory was 106.8MB in the beginning and 140.8MB in the end (delta: -34.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.56ms. Allocated memory is still 170.9MB. Free memory was 140.8MB in the beginning and 139.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 300.08ms. Allocated memory is still 170.9MB. Free memory was 139.7MB in the beginning and 129.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 43848.53ms. Allocated memory was 170.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 129.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.2GB. 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 -1 * i2 + N and consists of 5 locations. The remainder module has 51333 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 1. 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, 251 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 182 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital56 mio100 ax100 hnf100 lsp117 ukn56 mio100 lsp59 div100 bol100 ite100 ukn100 eq163 hnf97 smp100 dnf157 smp59 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 63ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - 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: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L46] 2 array_max := A[0]; VAL [array_max=0] [L47] 2 i2 := 0; VAL [array_max=0, i2=0] [L49] COND TRUE 2 i2 < N [L50] CALL 2 call lock_max(); [L76] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, array_max=0, i2=0] [L61] CALL 3 call lock_min(); [L87] 3 assume !min_lock; [L88] 3 min_lock := true; VAL [N=1, array_max=0, i2=0, min_lock=true] [L61] RET 3 call lock_min(); [L62] 3 min_samples[i1 - 1] := array_min; [L63] CALL 3 call release_min(); [L101] 2 assume !max_lock; [L102] 2 max_lock := true; VAL [N=1, array_max=0, array_min=4, i1=0, i2=0, max_lock=true, min_lock=true] [L50] RET 2 call lock_max(); [L51] 2 array_max := (if array_max < A[i2] then A[i2] else array_max); VAL [N=1, array_max=0, array_min=4, i1=0, i2=0, max_lock=true, min_lock=true] [L52] 2 i2 := i2 + 1; [L53] CALL 2 call release_max(); [L108] 2 max_lock := false; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=false, min_lock=true] [L53] RET 2 call release_max(); [L94] 3 min_lock := false; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=false, min_lock=false] [L63] RET 3 call release_min(); [L65] CALL 3 call lock_max(); [L101] 3 assume !max_lock; [L102] 3 max_lock := true; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=true, min_lock=false] [L65] RET 3 call lock_max(); [L66] 3 max_samples[i2 - 1] := array_max; [L67] CALL 3 call release_max(); [L108] 3 max_lock := false; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=false, min_lock=false] [L67] RET 3 call release_max(); Loop: [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_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: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L46] 2 array_max := A[0]; VAL [array_max=0] [L47] 2 i2 := 0; VAL [array_max=0, i2=0] [L49] COND TRUE 2 i2 < N [L50] CALL 2 call lock_max(); [L76] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, array_max=0, i2=0] [L61] CALL 3 call lock_min(); [L87] 3 assume !min_lock; [L88] 3 min_lock := true; VAL [N=1, array_max=0, i2=0, min_lock=true] [L61] RET 3 call lock_min(); [L62] 3 min_samples[i1 - 1] := array_min; [L63] CALL 3 call release_min(); [L101] 2 assume !max_lock; [L102] 2 max_lock := true; VAL [N=1, array_max=0, array_min=4, i1=0, i2=0, max_lock=true, min_lock=true] [L50] RET 2 call lock_max(); [L51] 2 array_max := (if array_max < A[i2] then A[i2] else array_max); VAL [N=1, array_max=0, array_min=4, i1=0, i2=0, max_lock=true, min_lock=true] [L52] 2 i2 := i2 + 1; [L53] CALL 2 call release_max(); [L108] 2 max_lock := false; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=false, min_lock=true] [L53] RET 2 call release_max(); [L94] 3 min_lock := false; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=false, min_lock=false] [L63] RET 3 call release_min(); [L65] CALL 3 call lock_max(); [L101] 3 assume !max_lock; [L102] 3 max_lock := true; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=true, min_lock=false] [L65] RET 3 call lock_max(); [L66] 3 max_samples[i2 - 1] := array_max; [L67] CALL 3 call release_max(); [L108] 3 max_lock := false; VAL [N=1, array_max=0, array_min=4, i1=0, i2=1, max_lock=false, min_lock=false] [L67] RET 3 call release_max(); Loop: [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); [L61] CALL call lock_min(); [L87] assume !min_lock; [L88] min_lock := true; [L61] RET call lock_min(); [L62] min_samples[i1 - 1] := array_min; [L63] CALL call release_min(); [L94] min_lock := false; [L63] RET call release_min(); [L65] CALL call lock_max(); [L101] assume !max_lock; [L102] max_lock := true; [L65] RET call lock_max(); [L66] max_samples[i2 - 1] := array_max; [L67] CALL call release_max(); [L108] max_lock := false; [L67] RET call release_max(); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:02:18,600 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...