/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-with_locks.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:19:10,389 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:19:10,450 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:19:10,480 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:19:10,480 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:19:10,481 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:19:10,482 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:19:10,482 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:19:10,482 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:19:10,485 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:19:10,485 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:19:10,486 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:19:10,486 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:19:10,487 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:19:10,487 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:19:10,487 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:19:10,488 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:19:10,488 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:19:10,488 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:19:10,488 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:19:10,488 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:19:10,488 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:19:10,489 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:19:10,491 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:19:10,491 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:19:10,491 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:19:10,492 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:19:10,493 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:19:10,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:19:10,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:19:10,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:19:10,709 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:19:10,710 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:19:10,711 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:19:10,711 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:19:10,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:19:10,751 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:19:10,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:10,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:19:10,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:19:10,762 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:19:10" (1/1) ... [2023-10-12 17:19:10,769 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:19:10" (1/1) ... [2023-10-12 17:19:10,783 INFO L138 Inliner]: procedures = 8, calls = 11, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 37 [2023-10-12 17:19:10,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:10,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:19:10,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:19:10,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:19:10,792 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:19:10" (1/1) ... [2023-10-12 17:19:10,793 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:19:10" (1/1) ... [2023-10-12 17:19:10,794 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:19:10" (1/1) ... [2023-10-12 17:19:10,795 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:19:10" (1/1) ... [2023-10-12 17:19:10,797 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:19:10" (1/1) ... [2023-10-12 17:19:10,802 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:19:10" (1/1) ... [2023-10-12 17:19:10,803 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:19:10" (1/1) ... [2023-10-12 17:19:10,804 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:19:10" (1/1) ... [2023-10-12 17:19:10,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:19:10,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:19:10,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:19:10,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:19:10,809 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:19:10" (1/1) ... [2023-10-12 17:19:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:10,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:10,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:10,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:19:10,861 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:19:10,861 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:19:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:19:10,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:19:10,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:19:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:19:10,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:19:10,862 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:19:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:19:10,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:19:10,862 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:19:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:19:10,863 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:19:10,903 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:19:10,905 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:19:11,027 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:19:11,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:19:11,037 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:19:11,039 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:11 BoogieIcfgContainer [2023-10-12 17:19:11,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:19:11,039 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:19:11,040 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:19:11,059 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:19:11,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:11,060 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:19:10" (1/2) ... [2023-10-12 17:19:11,061 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d96d51e and model type min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:19:11, skipping insertion in model container [2023-10-12 17:19:11,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:11,062 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:19:11" (2/2) ... [2023-10-12 17:19:11,063 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-with_locks.bpl [2023-10-12 17:19:11,114 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:19:11,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 109 flow [2023-10-12 17:19:11,161 INFO L124 PetriNetUnfolderBase]: 3/38 cut-off events. [2023-10-12 17:19:11,162 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:19:11,165 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:19:11,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 109 flow [2023-10-12 17:19:11,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 38 transitions, 91 flow [2023-10-12 17:19:11,172 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:19:11,181 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 91 flow [2023-10-12 17:19:11,183 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 91 flow [2023-10-12 17:19:11,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 91 flow [2023-10-12 17:19:11,191 INFO L124 PetriNetUnfolderBase]: 3/38 cut-off events. [2023-10-12 17:19:11,191 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:19:11,192 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:19:11,192 INFO L119 LiptonReduction]: Number of co-enabled transitions 780 [2023-10-12 17:19:11,382 INFO L134 LiptonReduction]: Checked pairs total: 1121 [2023-10-12 17:19:11,382 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:19:11,394 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:19:11,394 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:19:11,394 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:19:11,394 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:19:11,394 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:19:11,395 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:19:11,395 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:19:11,395 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:19:11,395 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 28 transitions, 71 flow [2023-10-12 17:19:11,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:11,401 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-10-12 17:19:11,401 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:19:11,401 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:11,403 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:19:11,403 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 28 transitions, 71 flow [2023-10-12 17:19:11,406 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:11,407 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-10-12 17:19:11,407 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:19:11,407 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:11,418 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:19:11,418 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#[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] 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:19:11,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash 163463, now seen corresponding path program 1 times [2023-10-12 17:19:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103824231] [2023-10-12 17:19:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:11,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:11,545 INFO L85 PathProgramCache]: Analyzing trace with hash 5520322, now seen corresponding path program 1 times [2023-10-12 17:19:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098668620] [2023-10-12 17:19:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:11,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash 642254664, now seen corresponding path program 1 times [2023-10-12 17:19:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853003194] [2023-10-12 17:19:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:11,718 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:11,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:11,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:11,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:11,719 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:11,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:11,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:11,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:11,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-with_locks.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:19:11,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:11,720 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:11,733 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:19:11,742 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:19:11,785 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:19:11,880 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:11,883 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:11,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:11,885 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:19:11,886 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:19:11,888 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:19:11,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:11,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:11,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:11,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:11,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:11,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:11,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:11,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:11,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:11,929 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:19:11,931 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:19:11,933 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:19:11,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:11,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:11,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:11,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:11,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:11,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:11,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:11,963 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:19:11,963 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:19:11,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:11,976 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:19:11,978 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:19:12,014 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:12,046 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:12,046 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:12,047 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2023-10-12 17:19:12,052 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:19:12,054 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:19:12,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:12,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:12,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:12,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:19:12,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:12,175 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:19:12,212 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:19:12,213 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:19:12,402 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 8 states and 480 transitions. [2023-10-12 17:19:12,403 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:12,408 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:12,414 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:19:12,417 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:19:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2023-10-12 17:19:12,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:19:12,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:12,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:19:12,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:12,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 3 letters. Loop has 8 letters. [2023-10-12 17:19:12,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:12,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 494 transitions, 2246 flow [2023-10-12 17:19:12,628 INFO L124 PetriNetUnfolderBase]: 2838/4126 cut-off events. [2023-10-12 17:19:12,628 INFO L125 PetriNetUnfolderBase]: For 552/552 co-relation queries the response was YES. [2023-10-12 17:19:12,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8753 conditions, 4126 events. 2838/4126 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20094 event pairs, 364 based on Foata normal form. 0/3145 useless extension candidates. Maximal degree in co-relation 7442. Up to 980 conditions per place. [2023-10-12 17:19:12,636 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 51 places, 494 transitions, 2246 flow [2023-10-12 17:19:12,661 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 51 places, 494 transitions, 2246 flow [2023-10-12 17:19:12,661 INFO L430 stractBuchiCegarLoop]: Abstraction has has 51 places, 494 transitions, 2246 flow [2023-10-12 17:19:12,661 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:19:12,661 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 places, 494 transitions, 2246 flow [2023-10-12 17:19:12,670 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:19:12,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:12,685 INFO L124 PetriNetUnfolderBase]: 323/484 cut-off events. [2023-10-12 17:19:12,685 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-10-12 17:19:12,685 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:12,685 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] 133#[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] 135#[L75, $Ultimate##0, L47]true [104] L47-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2] 137#[L75, $Ultimate##0, L49-1]true [2023-10-12 17:19:12,686 INFO L750 eck$LassoCheckResult]: Loop: 137#[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] 140#[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] 142#[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] 144#[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] 137#[L75, $Ultimate##0, L49-1]true [2023-10-12 17:19:12,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 5081221, now seen corresponding path program 1 times [2023-10-12 17:19:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080666927] [2023-10-12 17:19:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:12,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 5381317, now seen corresponding path program 1 times [2023-10-12 17:19:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:12,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453529365] [2023-10-12 17:19:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:12,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1780497591, now seen corresponding path program 1 times [2023-10-12 17:19:12,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:12,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887852931] [2023-10-12 17:19:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:12,780 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:12,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:12,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:12,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:12,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:12,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:12,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:12,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-with_locks.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:19:12,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:12,781 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:12,782 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:19:12,786 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:19:12,815 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:19:12,817 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:19:12,819 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:19:12,911 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:12,911 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:12,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:12,917 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:19:12,936 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:19:12,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:12,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:12,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:12,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:12,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:12,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:12,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:12,945 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:19:12,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:12,973 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:19:12,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:12,976 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:19:12,983 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:19:12,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:12,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:12,990 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:19:12,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:13,007 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:19:13,007 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:19:13,013 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:19:13,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:13,049 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:19:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:13,050 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:19:13,052 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:19:13,054 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:19:13,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:13,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:13,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:13,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:13,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:13,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:13,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:13,085 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:19:13,085 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:19:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:13,093 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:19:13,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:13,101 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:19:13,106 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:13,106 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:13,106 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2023-10-12 17:19:13,111 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:19:13,112 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:19:13,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:13,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:13,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:13,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:19:13,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:13,187 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:19:13,188 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:19:13,188 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:19:13,288 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 8 states and 480 transitions. [2023-10-12 17:19:13,288 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:13,321 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:13,322 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:19:13,323 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:19:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2023-10-12 17:19:13,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:19:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:19:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 267 transitions. Stem has 4 letters. Loop has 8 letters. [2023-10-12 17:19:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:13,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 8712 transitions, 57132 flow [2023-10-12 17:19:13,581 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:19:14,888 INFO L124 PetriNetUnfolderBase]: 8685/12161 cut-off events. [2023-10-12 17:19:14,888 INFO L125 PetriNetUnfolderBase]: For 1384/1384 co-relation queries the response was YES. [2023-10-12 17:19:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37884 conditions, 12161 events. 8685/12161 cut-off events. For 1384/1384 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 64539 event pairs, 155 based on Foata normal form. 0/8268 useless extension candidates. Maximal degree in co-relation 32140. Up to 3068 conditions per place. [2023-10-12 17:19:14,902 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 67 places, 8712 transitions, 57132 flow [2023-10-12 17:19:14,964 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 67 places, 8712 transitions, 57132 flow [2023-10-12 17:19:14,964 INFO L430 stractBuchiCegarLoop]: Abstraction has has 67 places, 8712 transitions, 57132 flow [2023-10-12 17:19:14,964 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:19:14,964 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 67 places, 8712 transitions, 57132 flow [2023-10-12 17:19:15,195 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:15,195 INFO L124 PetriNetUnfolderBase]: 1185/1674 cut-off events. [2023-10-12 17:19:15,195 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2023-10-12 17:19:15,195 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:15,196 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] 133#[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] 207#[$Ultimate##0, $Ultimate##0, L60, L76]true [2023-10-12 17:19:15,196 INFO L750 eck$LassoCheckResult]: Loop: 207#[$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] 210#[$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] 212#[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] 214#[$Ultimate##0, L100, $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] 216#[$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] 218#[$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] 207#[$Ultimate##0, $Ultimate##0, L60, L76]true [2023-10-12 17:19:15,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 163945, now seen corresponding path program 1 times [2023-10-12 17:19:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124441992] [2023-10-12 17:19:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:15,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash 912558154, now seen corresponding path program 1 times [2023-10-12 17:19:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677061319] [2023-10-12 17:19:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:15,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1208949426, now seen corresponding path program 1 times [2023-10-12 17:19:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574403586] [2023-10-12 17:19:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:15,396 INFO L201 PluginConnector]: Adding new model min-max-sample-with_locks.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:19:15 BoogieIcfgContainer [2023-10-12 17:19:15,396 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:19:15,397 INFO L158 Benchmark]: Toolchain (without parser) took 4645.03ms. Allocated memory was 185.6MB in the beginning and 621.8MB in the end (delta: 436.2MB). Free memory was 134.0MB in the beginning and 522.0MB in the end (delta: -388.0MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2023-10-12 17:19:15,397 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 185.6MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:15,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.52ms. Allocated memory is still 185.6MB. Free memory was 133.9MB in the beginning and 132.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:19:15,398 INFO L158 Benchmark]: Boogie Preprocessor took 22.10ms. Allocated memory is still 185.6MB. Free memory was 132.0MB in the beginning and 130.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:15,399 INFO L158 Benchmark]: RCFGBuilder took 230.82ms. Allocated memory was 185.6MB in the beginning and 283.1MB in the end (delta: 97.5MB). Free memory was 130.7MB in the beginning and 248.5MB in the end (delta: -117.7MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2023-10-12 17:19:15,401 INFO L158 Benchmark]: BuchiAutomizer took 4356.51ms. Allocated memory was 283.1MB in the beginning and 621.8MB in the end (delta: 338.7MB). Free memory was 248.3MB in the beginning and 522.0MB in the end (delta: -273.6MB). Peak memory consumption was 64.9MB. Max. memory is 8.0GB. [2023-10-12 17:19:15,405 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 185.6MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.52ms. Allocated memory is still 185.6MB. Free memory was 133.9MB in the beginning and 132.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.10ms. Allocated memory is still 185.6MB. Free memory was 132.0MB in the beginning and 130.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 230.82ms. Allocated memory was 185.6MB in the beginning and 283.1MB in the end (delta: 97.5MB). Free memory was 130.7MB in the beginning and 248.5MB in the end (delta: -117.7MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4356.51ms. Allocated memory was 283.1MB in the beginning and 621.8MB in the end (delta: 338.7MB). Free memory was 248.3MB in the beginning and 522.0MB in the end (delta: -273.6MB). Peak memory consumption was 64.9MB. 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 57132 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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.1s 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: 55ms 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: 68, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 59, dependent conditional: 0, dependent unconditional: 59, 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:19:15,427 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...