/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:09,464 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:09,537 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:37:09,567 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:09,568 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:09,568 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:09,571 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:09,571 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:09,571 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:09,575 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:09,575 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:09,575 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:09,575 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:09,577 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:09,577 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:09,578 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:09,578 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:09,578 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:09,578 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:09,579 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:09,579 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:09,580 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:09,581 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:09,581 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:09,581 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:09,581 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:09,581 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:09,582 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:09,582 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:09,582 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:09,583 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:09,583 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:09,584 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:09,585 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:09,585 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:37:09,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:09,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:09,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:09,841 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:09,842 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:09,843 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 [2023-10-12 17:37:09,843 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl' [2023-10-12 17:37:09,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:09,881 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:09,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:09,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:09,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:09,892 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,901 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,917 INFO L138 Inliner]: procedures = 8, calls = 11, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 37 [2023-10-12 17:37:09,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:09,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:09,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:09,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:09,927 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,927 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,930 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,930 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,933 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,938 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,939 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,940 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:09,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:09,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:09,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:09,946 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 12.10 05:37:09" (1/1) ... [2023-10-12 17:37:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:09,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:10,011 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:37:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:37:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:37:10,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:10,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:37:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:37:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:37:10,013 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:37:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:37:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:37:10,014 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:10,057 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:10,058 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:10,142 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:10,154 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:10,154 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:37:10,156 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:10 BoogieIcfgContainer [2023-10-12 17:37:10,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:10,157 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:10,157 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:10,160 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:10,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:10,161 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 12.10 05:37:09" (1/2) ... [2023-10-12 17:37:10,162 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@463b2257 and model type min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:10, skipping insertion in model container [2023-10-12 17:37:10,162 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:10,162 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 12.10 05:37:10" (2/2) ... [2023-10-12 17:37:10,163 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-with_locks.bpl [2023-10-12 17:37:10,217 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:10,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 109 flow [2023-10-12 17:37:10,275 INFO L124 PetriNetUnfolderBase]: 3/38 cut-off events. [2023-10-12 17:37:10,275 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:10,280 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. [2023-10-12 17:37:10,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 109 flow [2023-10-12 17:37:10,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 38 transitions, 91 flow [2023-10-12 17:37:10,287 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:10,299 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 91 flow [2023-10-12 17:37:10,301 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 91 flow [2023-10-12 17:37:10,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 91 flow [2023-10-12 17:37:10,312 INFO L124 PetriNetUnfolderBase]: 3/38 cut-off events. [2023-10-12 17:37:10,312 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:10,313 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. [2023-10-12 17:37:10,314 INFO L119 LiptonReduction]: Number of co-enabled transitions 780 [2023-10-12 17:37:10,522 INFO L134 LiptonReduction]: Checked pairs total: 1121 [2023-10-12 17:37:10,522 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:37:10,534 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:10,534 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:10,534 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:10,534 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:10,535 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:10,535 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:10,535 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:10,535 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:10,535 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 35 places, 28 transitions, 71 flow [2023-10-12 17:37:10,541 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][16], 3:2A:[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][12], 6:3A:[124] L33-->L35-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1][10]][11:4A:[150] L35-1-->L86-1: Formula: (and v_min_lock_26 (not v_min_lock_27) (< v_i1_16 v_N_11)) InVars {N=v_N_11, min_lock=v_min_lock_27, i1=v_i1_16} OutVars{N=v_N_11, min_lock=v_min_lock_26, i1=v_i1_16} AuxVars[] AssignedVars[min_lock][25], 15:5A:[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][3], 18:6A:[130] L38-->L94: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1][17], 19:7A:[152] L94-->L35-1: Formula: (not v_min_lock_35) InVars {} OutVars{min_lock=v_min_lock_35} AuxVars[] AssignedVars[min_lock][19]] [2023-10-12 17:37:10,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:10,543 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-10-12 17:37:10,543 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:10,543 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:10,546 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:10,546 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 35 places, 28 transitions, 71 flow [2023-10-12 17:37:10,550 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][16], 3:2A:[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][12], 6:3A:[124] L33-->L35-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1][10]][11:4A:[150] L35-1-->L86-1: Formula: (and v_min_lock_26 (not v_min_lock_27) (< v_i1_16 v_N_11)) InVars {N=v_N_11, min_lock=v_min_lock_27, i1=v_i1_16} OutVars{N=v_N_11, min_lock=v_min_lock_26, i1=v_i1_16} AuxVars[] AssignedVars[min_lock][25], 15:5A:[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][3], 18:6A:[130] L38-->L94: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1][17], 19:7A:[152] L94-->L35-1: Formula: (not v_min_lock_35) InVars {} OutVars{min_lock=v_min_lock_35} AuxVars[] AssignedVars[min_lock][19]] [2023-10-12 17:37:10,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:10,550 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-10-12 17:37:10,551 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:10,551 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:10,555 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 [2023-10-12 17:37:10,555 INFO L750 eck$LassoCheckResult]: Loop: 58#[L74, L35-1]true [150] L35-1-->L86-1: Formula: (and v_min_lock_26 (not v_min_lock_27) (< v_i1_16 v_N_11)) InVars {N=v_N_11, min_lock=v_min_lock_27, i1=v_i1_16} OutVars{N=v_N_11, min_lock=v_min_lock_26, i1=v_i1_16} AuxVars[] AssignedVars[min_lock] 61#[L74, L86-1]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] 63#[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] 65#[L94, L74]true [152] L94-->L35-1: Formula: (not v_min_lock_35) InVars {} OutVars{min_lock=v_min_lock_35} AuxVars[] AssignedVars[min_lock] 58#[L74, L35-1]true [2023-10-12 17:37:10,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 163463, now seen corresponding path program 1 times [2023-10-12 17:37:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100944316] [2023-10-12 17:37:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:10,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:10,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:10,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash 5520322, now seen corresponding path program 1 times [2023-10-12 17:37:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339345134] [2023-10-12 17:37:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:10,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:10,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:10,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 642254664, now seen corresponding path program 1 times [2023-10-12 17:37:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994462680] [2023-10-12 17:37:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:10,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:10,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:10,818 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:10,818 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:10,818 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:10,818 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:10,818 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:10,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:10,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:10,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:10,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-with_locks.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:10,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:10,819 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:10,831 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:10,840 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:10,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:10,983 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:10,987 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:10,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:10,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:10,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:10,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:37:11,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:11,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:11,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:11,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:11,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:11,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:11,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:11,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:11,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:37:11,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:11,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:11,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:11,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:37:11,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:11,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:11,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:11,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:11,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:11,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:11,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:11,088 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:11,088 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:11,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:11,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:37:11,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:11,113 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:11,114 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:11,114 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2023-10-12 17:37:11,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:11,124 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:11,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:11,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:11,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:11,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:11,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:11,282 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 [2023-10-12 17:37:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2023-10-12 17:37:11,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:37:11,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:11,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:37:11,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:11,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 3 letters. Loop has 8 letters. [2023-10-12 17:37:11,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:11,473 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 168 transitions, 762 flow [2023-10-12 17:37:11,473 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:11,474 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 41 places, 168 transitions, 762 flow [2023-10-12 17:37:11,534 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][98], 2:2A:[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][2], 5:3A:[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][8], 12:4A:[104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2][32]][42:5A:[146] L49-1-->L100-1: Formula: (and (not v_max_lock_16) v_max_lock_15 (< v_i2_15 v_N_7)) InVars {N=v_N_7, max_lock=v_max_lock_16, i2=v_i2_15} OutVars{N=v_N_7, max_lock=v_max_lock_15, i2=v_i2_15} AuxVars[] AssignedVars[max_lock][122], 91:6A:[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][44], 187:7A:[110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2][26], 188:8A:[151] L108-->L49-1: Formula: (not v_max_lock_34) InVars {} OutVars{max_lock=v_max_lock_34} AuxVars[] AssignedVars[max_lock][158]] [2023-10-12 17:37:11,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:11,535 INFO L124 PetriNetUnfolderBase]: 113/187 cut-off events. [2023-10-12 17:37:11,535 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:37:11,536 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:11,536 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] 118#[L75, $Ultimate##0, $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] 120#[L75, $Ultimate##0, L47]true [104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2] 122#[L75, $Ultimate##0, L49-1]true [2023-10-12 17:37:11,537 INFO L750 eck$LassoCheckResult]: Loop: 122#[L75, $Ultimate##0, L49-1]true [146] L49-1-->L100-1: Formula: (and (not v_max_lock_16) v_max_lock_15 (< v_i2_15 v_N_7)) InVars {N=v_N_7, max_lock=v_max_lock_16, i2=v_i2_15} OutVars{N=v_N_7, max_lock=v_max_lock_15, i2=v_i2_15} AuxVars[] AssignedVars[max_lock] 125#[L100-1, L75, $Ultimate##0]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] 127#[L75, $Ultimate##0, 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] 129#[L75, $Ultimate##0, L108]true [151] L108-->L49-1: Formula: (not v_max_lock_34) InVars {} OutVars{max_lock=v_max_lock_34} AuxVars[] AssignedVars[max_lock] 122#[L75, $Ultimate##0, L49-1]true [2023-10-12 17:37:11,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash 5081221, now seen corresponding path program 1 times [2023-10-12 17:37:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:11,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870204121] [2023-10-12 17:37:11,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:11,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:11,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:11,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 5381317, now seen corresponding path program 1 times [2023-10-12 17:37:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:11,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556840979] [2023-10-12 17:37:11,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:11,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:11,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:11,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1780497591, now seen corresponding path program 1 times [2023-10-12 17:37:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412589173] [2023-10-12 17:37:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:11,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:11,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:11,707 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:11,708 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:11,708 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:11,708 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:11,708 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:11,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:11,708 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:11,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:11,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-with_locks.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:11,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:11,708 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:11,710 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:11,714 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:11,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:11,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:11,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:11,864 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:11,864 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:11,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:11,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:11,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:11,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:37:11,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:11,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:11,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:11,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:11,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:11,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:11,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:11,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:11,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:11,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:11,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:37:11,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:11,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:11,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:11,946 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:11,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:11,962 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:11,963 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:11,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:11,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:11,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:12,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:12,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:12,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:12,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:12,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:12,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:12,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:12,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:37:12,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:12,034 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:12,034 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:12,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:12,048 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:12,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:37:12,066 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:12,067 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:12,067 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2023-10-12 17:37:12,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:12,076 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:12,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:12,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:12,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:12,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:12,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:12,150 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 [2023-10-12 17:37:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2023-10-12 17:37:12,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:37:12,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:12,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:37:12,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:12,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 4 letters. Loop has 8 letters. [2023-10-12 17:37:12,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:12,264 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 1008 transitions, 6588 flow [2023-10-12 17:37:12,264 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:12,264 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 1008 transitions, 6588 flow [2023-10-12 17:37:12,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:37:12,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:37:12,338 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][592], 3:2A:[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][448], 11:3A:[124] L33-->L35-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1][376], 32:4A:[150] L35-1-->L86-1: Formula: (and v_min_lock_26 (not v_min_lock_27) (< v_i1_16 v_N_11)) InVars {N=v_N_11, min_lock=v_min_lock_27, i1=v_i1_16} OutVars{N=v_N_11, min_lock=v_min_lock_26, i1=v_i1_16} AuxVars[] AssignedVars[min_lock][922]][86:5A:[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][112], 174:6A:[130] L38-->L94: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1][616], 319:7A:[152] L94-->L35-1: Formula: (not v_min_lock_35) InVars {} OutVars{min_lock=v_min_lock_35} AuxVars[] AssignedVars[min_lock][706], 320:8A:[150] L35-1-->L86-1: Formula: (and v_min_lock_26 (not v_min_lock_27) (< v_i1_16 v_N_11)) InVars {N=v_N_11, min_lock=v_min_lock_27, i1=v_i1_16} OutVars{N=v_N_11, min_lock=v_min_lock_26, i1=v_i1_16} AuxVars[] AssignedVars[min_lock][928]] [2023-10-12 17:37:12,346 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][592], 2:2A:[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][16], 5:3A:[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][52], 12:4A:[104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2][196], 36:5A:[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][446]][104:6A:[146] L49-1-->L100-1: Formula: (and (not v_max_lock_16) v_max_lock_15 (< v_i2_15 v_N_7)) InVars {N=v_N_7, max_lock=v_max_lock_16, i2=v_i2_15} OutVars{N=v_N_7, max_lock=v_max_lock_15, i2=v_i2_15} AuxVars[] AssignedVars[max_lock][735], 205:7A:[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][269], 388:8A:[110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2][161], 391:9A:[151] L108-->L49-1: Formula: (not v_max_lock_34) InVars {} OutVars{max_lock=v_max_lock_34} AuxVars[] AssignedVars[max_lock][950]] [2023-10-12 17:37:12,347 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][592], 2:2A:[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][16], 5:3A:[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][52], 12:4A:[104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2][196], 42:5A:[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][482]][115:6A:[146] L49-1-->L100-1: Formula: (and (not v_max_lock_16) v_max_lock_15 (< v_i2_15 v_N_7)) InVars {N=v_N_7, max_lock=v_max_lock_16, i2=v_i2_15} OutVars{N=v_N_7, max_lock=v_max_lock_15, i2=v_i2_15} AuxVars[] AssignedVars[max_lock][735], 206:7A:[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][269], 395:8A:[110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2][161], 399:9A:[151] L108-->L49-1: Formula: (not v_max_lock_34) InVars {} OutVars{max_lock=v_max_lock_34} AuxVars[] AssignedVars[max_lock][950]] [2023-10-12 17:37:12,347 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][592], 2:2A:[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][16], 5:3A:[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][52], 12:4A:[104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2][196], 50:5A:[146] L49-1-->L100-1: Formula: (and (not v_max_lock_16) v_max_lock_15 (< v_i2_15 v_N_7)) InVars {N=v_N_7, max_lock=v_max_lock_16, i2=v_i2_15} OutVars{N=v_N_7, max_lock=v_max_lock_15, i2=v_i2_15} AuxVars[] AssignedVars[max_lock][734]][100:6A:[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][269], 204:7A:[110] L52-->L108: Formula: (= v_i2_4 (+ v_i2_5 1)) InVars {i2=v_i2_5} OutVars{i2=v_i2_4} AuxVars[] AssignedVars[i2][161], 400:8A:[151] L108-->L49-1: Formula: (not v_max_lock_34) InVars {} OutVars{max_lock=v_max_lock_34} AuxVars[] AssignedVars[max_lock][950], 404:9A:[146] L49-1-->L100-1: Formula: (and (not v_max_lock_16) v_max_lock_15 (< v_i2_15 v_N_7)) InVars {N=v_N_7, max_lock=v_max_lock_16, i2=v_i2_15} OutVars{N=v_N_7, max_lock=v_max_lock_15, i2=v_i2_15} AuxVars[] AssignedVars[max_lock][735]] [2023-10-12 17:37:12,385 ERROR L47 etriNetUnfolderRabin]: [1:1A:[135] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][592], 2:2A:[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][16], 8:3A:[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][484]][22:4A:[147] L60-->L86-1: Formula: (and v_min_lock_22 (not v_min_lock_23)) InVars {min_lock=v_min_lock_23} OutVars{min_lock=v_min_lock_22} AuxVars[] AssignedVars[min_lock][880], 69:5A:[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][340], 159:6A:[144] L94-->L100: Formula: (not v_min_lock_20) InVars {} OutVars{min_lock=v_min_lock_20} AuxVars[] AssignedVars[min_lock][988], 300:7A:[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][520], 508:8A:[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][232], 509:9A:[153] L108-->L60: Formula: (not v_max_lock_47) InVars {} OutVars{max_lock=v_max_lock_47} AuxVars[] AssignedVars[max_lock][808]] [2023-10-12 17:37:12,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:12,387 INFO L124 PetriNetUnfolderBase]: 335/508 cut-off events. [2023-10-12 17:37:12,387 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-10-12 17:37:12,387 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:12,391 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] 118#[L75, $Ultimate##0, $Ultimate##0]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] 177#[$Ultimate##0, $Ultimate##0, L60, L76]true [2023-10-12 17:37:12,391 INFO L750 eck$LassoCheckResult]: Loop: 177#[$Ultimate##0, $Ultimate##0, L60, L76]true [147] L60-->L86-1: Formula: (and v_min_lock_22 (not v_min_lock_23)) InVars {min_lock=v_min_lock_23} OutVars{min_lock=v_min_lock_22} AuxVars[] AssignedVars[min_lock] 180#[$Ultimate##0, $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] 182#[L94, $Ultimate##0, $Ultimate##0, L76]true [144] L94-->L100: Formula: (not v_min_lock_20) InVars {} OutVars{min_lock=v_min_lock_20} AuxVars[] AssignedVars[min_lock] 184#[L100, $Ultimate##0, $Ultimate##0, 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] 186#[$Ultimate##0, $Ultimate##0, 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] 188#[$Ultimate##0, $Ultimate##0, L108, L76]true [153] L108-->L60: Formula: (not v_max_lock_47) InVars {} OutVars{max_lock=v_max_lock_47} AuxVars[] AssignedVars[max_lock] 177#[$Ultimate##0, $Ultimate##0, L60, L76]true [2023-10-12 17:37:12,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 163945, now seen corresponding path program 1 times [2023-10-12 17:37:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522160931] [2023-10-12 17:37:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:12,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 912558154, now seen corresponding path program 1 times [2023-10-12 17:37:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023413310] [2023-10-12 17:37:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:12,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1208949426, now seen corresponding path program 1 times [2023-10-12 17:37:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200366091] [2023-10-12 17:37:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,514 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:12 BoogieIcfgContainer [2023-10-12 17:37:12,514 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:12,515 INFO L158 Benchmark]: Toolchain (without parser) took 2633.66ms. Allocated memory was 181.4MB in the beginning and 289.4MB in the end (delta: 108.0MB). Free memory was 130.6MB in the beginning and 229.1MB in the end (delta: -98.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:12,515 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 181.4MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:12,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.61ms. Allocated memory is still 181.4MB. Free memory was 130.4MB in the beginning and 128.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:12,516 INFO L158 Benchmark]: Boogie Preprocessor took 25.91ms. Allocated memory is still 181.4MB. Free memory was 128.5MB in the beginning and 127.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:12,516 INFO L158 Benchmark]: RCFGBuilder took 210.66ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 117.4MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:12,517 INFO L158 Benchmark]: BuchiAutomizer took 2357.10ms. Allocated memory was 181.4MB in the beginning and 289.4MB in the end (delta: 108.0MB). Free memory was 117.3MB in the beginning and 229.1MB in the end (delta: -111.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:12,519 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.24ms. Allocated memory is still 181.4MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.61ms. Allocated memory is still 181.4MB. Free memory was 130.4MB in the beginning and 128.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.91ms. Allocated memory is still 181.4MB. Free memory was 128.5MB in the beginning and 127.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.66ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 117.4MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2357.10ms. Allocated memory was 181.4MB in the beginning and 289.4MB in the end (delta: 108.0MB). Free memory was 117.3MB in the beginning and 229.1MB in the end (delta: -111.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program 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 6588 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 182 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital49 mio100 ax100 hnf100 lsp118 ukn56 mio100 lsp66 div100 bol100 ite100 ukn100 eq172 hnf94 smp100 dnf150 smp62 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 85ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 60]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L74] FORK 0 fork 1 computeMin(); [L75] FORK 0 fork 2, 2 computeMax(); [L76] FORK 0 fork 3, 3, 3 sample(); 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(); 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(); [L76] FORK 0 fork 3, 3, 3 sample(); 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(); End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 35 PlacesAfterwards, 38 TransitionsBefore, 28 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1121 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 813, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 548, independent: 523, independent conditional: 0, independent unconditional: 523, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 548, independent: 518, independent conditional: 0, independent unconditional: 518, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 813, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 548, unknown conditional: 0, unknown unconditional: 548] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:37:12,541 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...