About the Execution of Marcie+red for LamportFastMutEx-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9064.991 | 3600000.00 | 3644407.00 | 6633.40 | 42 ? 6 7 7 42 6 6 7 7 1 6 1 7 6 7 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420200381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LamportFastMutEx-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200381
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679487500949
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 12:18:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 12:18:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:18:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 12:18:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 12:18:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2023-03-22 12:18:23] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 12:18:23] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2023-03-22 12:18:23] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 12:18:23] [INFO ] Computed 2 place invariants in 6 ms
FORMULA LamportFastMutEx-COL-7-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 12:18:23] [INFO ] Invariant cache hit.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 12:18:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 12:18:23] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:18:23] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-22 12:18:23] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:18:23] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:18:23] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:18:23] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 12:18:23] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:18:24] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 12:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 12:18:24] [INFO ] Added : 5 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 12:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 12:18:24] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 12:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:18:24] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 12:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 12:18:24] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 12:18:24] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [49, 7, 7, 7, 7, 49, 7, 7, 7, 7, 7, 7]
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 12:18:24] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 34 ms.
[2023-03-22 12:18:24] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :88
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :88
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :87
FORMULA LamportFastMutEx-COL-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :78
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :10
FORMULA LamportFastMutEx-COL-7-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :85
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :75
[2023-03-22 12:18:24] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 12:18:24] [INFO ] Computed 65 place invariants in 9 ms
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 12:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-22 12:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:24] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 12:18:24] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 12:18:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 55 ms returned sat
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 3 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-22 12:18:25] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-22 12:18:26] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-22 12:18:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 12:18:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1155 ms
[2023-03-22 12:18:26] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:26] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:26] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2023-03-22 12:18:26] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-22 12:18:27] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-22 12:18:27] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-22 12:18:27] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-22 12:18:27] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-22 12:18:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-22 12:18:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 12:18:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 494 ms
[2023-03-22 12:18:27] [INFO ] Added : 144 causal constraints over 31 iterations in 1361 ms. Result :sat
Minimization took 260 ms.
[2023-03-22 12:18:28] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:28] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 12:18:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:28] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:28] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2023-03-22 12:18:28] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-22 12:18:29] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-22 12:18:29] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-22 12:18:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 817 ms
[2023-03-22 12:18:29] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 25 ms.
[2023-03-22 12:18:29] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-22 12:18:29] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 12:18:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-22 12:18:29] [INFO ] Added : 97 causal constraints over 21 iterations in 705 ms. Result :sat
Minimization took 164 ms.
[2023-03-22 12:18:30] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 12:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:30] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-22 12:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 12:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:30] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:18:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-22 12:18:30] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 22 ms.
[2023-03-22 12:18:30] [INFO ] Added : 64 causal constraints over 14 iterations in 356 ms. Result :sat
Minimization took 96 ms.
[2023-03-22 12:18:30] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 12:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:30] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 12:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 12:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:31] [INFO ] [Nat]Added 91 Read/Feed constraints in 65 ms returned sat
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 12:18:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 597 ms
[2023-03-22 12:18:31] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 23 ms.
[2023-03-22 12:18:31] [INFO ] Added : 43 causal constraints over 9 iterations in 258 ms. Result :sat
Minimization took 235 ms.
[2023-03-22 12:18:32] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:32] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 12:18:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 12:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 12:18:32] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-22 12:18:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 561 ms
[2023-03-22 12:18:32] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 22 ms.
[2023-03-22 12:18:33] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2023-03-22 12:18:33] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-03-22 12:18:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2023-03-22 12:18:33] [INFO ] Added : 102 causal constraints over 21 iterations in 766 ms. Result :sat
Minimization took 188 ms.
[2023-03-22 12:18:33] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:34] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 12:18:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 5 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:18:34] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2023-03-22 12:18:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1439 ms
[2023-03-22 12:18:35] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:35] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 12:18:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 12:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:35] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 12:18:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2023-03-22 12:18:35] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-22 12:18:36] [INFO ] Added : 76 causal constraints over 16 iterations in 370 ms. Result :sat
Minimization took 73 ms.
[2023-03-22 12:18:36] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:36] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 12:18:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:36] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:18:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2023-03-22 12:18:36] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 12:18:36] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 12:18:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 12:18:36] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 12:18:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 12:18:36] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 870 ms
[2023-03-22 12:18:37] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:37] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:18:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:18:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-22 12:18:37] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:18:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 665 ms
Current structural bounds on expressions (after SMT) : [42, 7, 7, 7, 49, 7, 6, 7, 6, 6] Max seen :[42, 1, 5, 4, 28, 5, 6, 6, 6, 6]
FORMULA LamportFastMutEx-COL-7-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-00 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 77 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 219 transition count 455
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 64 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 212/219 places, 455/462 transitions.
Normalized transition count is 329 out of 455 initially.
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 12:18:39] [INFO ] Computed 65 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3083 ms. (steps per millisecond=324 ) properties (out of 5) seen :46
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 5) seen :42
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1445 ms. (steps per millisecond=692 ) properties (out of 5) seen :49
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 5) seen :25
[2023-03-22 12:18:46] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 12:18:46] [INFO ] Computed 65 place invariants in 4 ms
[2023-03-22 12:18:47] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 12:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:47] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-22 12:18:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:47] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 12:18:47] [INFO ] [Nat]Added 91 Read/Feed constraints in 9 ms returned sat
[2023-03-22 12:18:47] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 12:18:47] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2023-03-22 12:18:47] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 0 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 12:18:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 12:18:49] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 12:18:49] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2023-03-22 12:18:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1464 ms
[2023-03-22 12:18:49] [INFO ] Added : 112 causal constraints over 25 iterations in 2065 ms. Result :sat
Minimization took 199 ms.
[2023-03-22 12:18:49] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 12:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:49] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 12:18:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2023-03-22 12:18:49] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 12:18:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 12:18:49] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-03-22 12:18:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1010 ms
[2023-03-22 12:18:50] [INFO ] [Real]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-22 12:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-22 12:18:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 12:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:50] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2023-03-22 12:18:50] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-22 12:18:51] [INFO ] Added : 84 causal constraints over 17 iterations in 401 ms. Result :sat
Minimization took 70 ms.
[2023-03-22 12:18:51] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 12:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:51] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 12:18:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 12:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 12:18:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 78 ms returned sat
[2023-03-22 12:18:51] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 12:18:51] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 12:18:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 12:18:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 987 ms
[2023-03-22 12:18:52] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 12:18:53] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-22 12:18:53] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 12:18:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-22 12:18:53] [INFO ] Added : 71 causal constraints over 15 iterations in 709 ms. Result :sat
Minimization took 916 ms.
[2023-03-22 12:18:54] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:54] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:18:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:18:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:54] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 12:18:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2023-03-22 12:18:54] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:18:54] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:18:54] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-22 12:18:54] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-22 12:18:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1045 ms
Current structural bounds on expressions (after SMT) : [7, 6, 7, 49, 6] Max seen :[1, 6, 6, 39, 6]
FORMULA LamportFastMutEx-COL-7-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 63 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 28 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 212/212 places, 455/455 transitions.
Normalized transition count is 329 out of 455 initially.
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 12:18:56] [INFO ] Computed 65 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2637 ms. (steps per millisecond=379 ) properties (out of 3) seen :36
FORMULA LamportFastMutEx-COL-7-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 2) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1426 ms. (steps per millisecond=701 ) properties (out of 2) seen :43
[2023-03-22 12:19:01] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 12:19:01] [INFO ] Computed 65 place invariants in 5 ms
[2023-03-22 12:19:01] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:01] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:19:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:19:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 12:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:01] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 12:19:01] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 12:19:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-22 12:19:01] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 22 ms.
[2023-03-22 12:19:01] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2023-03-22 12:19:02] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 12:19:03] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 12:19:03] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2023-03-22 12:19:03] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2023-03-22 12:19:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1384 ms
[2023-03-22 12:19:03] [INFO ] Added : 112 causal constraints over 25 iterations in 2018 ms. Result :sat
Minimization took 200 ms.
[2023-03-22 12:19:03] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 12:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:03] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:19:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:19:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 12:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:03] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 12:19:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 84 ms returned sat
[2023-03-22 12:19:03] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 12:19:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1066 ms
Current structural bounds on expressions (after SMT) : [7, 42] Max seen :[1, 42]
FORMULA LamportFastMutEx-COL-7-UpperBounds-05 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 455/455 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 448
Applied a total of 14 rules in 30 ms. Remains 205 /212 variables (removed 7) and now considering 448/455 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 205/212 places, 448/455 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 12:19:05] [INFO ] Computed 65 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1998 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=1572 ) properties (out of 1) seen :1
[2023-03-22 12:19:07] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 12:19:07] [INFO ] Computed 65 place invariants in 5 ms
[2023-03-22 12:19:07] [INFO ] [Real]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-22 12:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:07] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-22 12:19:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:19:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-22 12:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:07] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 12:19:07] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 12:19:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2023-03-22 12:19:07] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 12:19:08] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 12:19:09] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2023-03-22 12:19:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 824 ms
[2023-03-22 12:19:09] [INFO ] Added : 73 causal constraints over 15 iterations in 1177 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 12:19:09] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:09] [INFO ] Invariant cache hit.
[2023-03-22 12:19:09] [INFO ] Implicit Places using invariants in 221 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 235 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 255 ms. Remains : 198/205 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 12:19:09] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 1) seen :1
[2023-03-22 12:19:12] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 12:19:12] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 12:19:12] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 12:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:12] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 12:19:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:19:12] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-22 12:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:12] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 12:19:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 12:19:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 12:19:12] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 12:19:13] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2023-03-22 12:19:14] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2023-03-22 12:19:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 12:19:14] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-22 12:19:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1142 ms
[2023-03-22 12:19:14] [INFO ] Added : 146 causal constraints over 31 iterations in 1932 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 12:19:14] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:14] [INFO ] Invariant cache hit.
[2023-03-22 12:19:14] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-22 12:19:14] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:14] [INFO ] Invariant cache hit.
[2023-03-22 12:19:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 12:19:15] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-22 12:19:15] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 12:19:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:15] [INFO ] Invariant cache hit.
[2023-03-22 12:19:15] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 198/198 places, 448/448 transitions.
Starting property specific reduction for LamportFastMutEx-COL-7-UpperBounds-01
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 12:19:15] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-22 12:19:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 12:19:15] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 12:19:15] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-22 12:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:15] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-22 12:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:19:15] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 12:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:15] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 12:19:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 12:19:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2023-03-22 12:19:15] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 18 ms.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2023-03-22 12:19:16] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-22 12:19:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 12:19:17] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-22 12:19:17] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2023-03-22 12:19:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 12:19:17] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-22 12:19:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1100 ms
[2023-03-22 12:19:17] [INFO ] Added : 146 causal constraints over 31 iterations in 1886 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 12:19:17] [INFO ] Computed 58 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 1) seen :1
[2023-03-22 12:19:20] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 12:19:20] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-22 12:19:20] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-22 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:20] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-22 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:19:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:19:20] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 12:19:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 12:19:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2023-03-22 12:19:20] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-22 12:19:21] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-22 12:19:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 12:19:21] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 12:19:21] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-22 12:19:21] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 12:19:21] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-22 12:19:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1104 ms
[2023-03-22 12:19:22] [INFO ] Added : 146 causal constraints over 31 iterations in 1884 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 12:19:22] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:22] [INFO ] Invariant cache hit.
[2023-03-22 12:19:23] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-22 12:19:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:23] [INFO ] Invariant cache hit.
[2023-03-22 12:19:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 12:19:23] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-22 12:19:23] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 12:19:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 12:19:23] [INFO ] Invariant cache hit.
[2023-03-22 12:19:23] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-COL-7-UpperBounds-01 in 8243 ms.
[2023-03-22 12:19:23] [INFO ] Flatten gal took : 115 ms
[2023-03-22 12:19:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-22 12:19:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 448 transitions and 2212 arcs took 5 ms.
Total runtime 61389 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: LamportFastMutEx_COL_7_unf
(NrP: 198 NrTr: 448 NrArc: 2212)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec
net check time: 0m 0.000sec
init dd package: 0m 2.698sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7079348 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096092 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
119013 536620 440251 1127797 1019111 975484 956555 916659 1092339 1010076 1069787 1078588
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LamportFastMutEx-COL-7, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420200381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;