About the Execution of LTSMin+red for LamportFastMutEx-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9694.619 | 3600000.00 | 14297924.00 | 402.90 | 6 1 ? 6 30 6 5 5 6 5 1 6 6 5 5 5 | 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.r233-tall-167856418800373.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 ltsminxred
Input is LamportFastMutEx-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:40 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 28K 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 8.2K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:43 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 42K 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-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679508206982
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 18:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 18:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:03:28] [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 18:03:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 18:03:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 672 ms
[2023-03-22 18:03:29] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 18:03:29] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 18:03:29] [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 18:03:29] [INFO ] Computed 2 place invariants in 5 ms
FORMULA LamportFastMutEx-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 18:03:29] [INFO ] Invariant cache hit.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 18:03:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 18:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 18:03:29] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 18:03:29] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 18:03:29] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 18:03:29] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 18:03:29] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 18:03:29] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 18:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 18:03:30] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 18:03:30] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 18:03:30] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 18:03:30] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 18:03:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 18:03:30] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 18:03:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 18:03:30] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6, 6]
Domain [pid(7), pid(7)] 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 18:03:30] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 25 ms.
[2023-03-22 18:03:30] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :58
FORMULA LamportFastMutEx-COL-6-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 :63
FORMULA LamportFastMutEx-COL-6-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :46
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 :44
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :8
FORMULA LamportFastMutEx-COL-6-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :41
[2023-03-22 18:03:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 18:03:30] [INFO ] Computed 50 place invariants in 9 ms
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-22 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 18:03:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:03:30] [INFO ] [Nat]Added 72 Read/Feed constraints in 21 ms returned sat
[2023-03-22 18:03:30] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 5 ms to minimize.
[2023-03-22 18:03:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-22 18:03:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-03-22 18:03:31] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 29 ms.
[2023-03-22 18:03:31] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:03:31] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2023-03-22 18:03:31] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-03-22 18:03:31] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:03:31] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2023-03-22 18:03:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1022 ms
[2023-03-22 18:03:32] [INFO ] Added : 116 causal constraints over 25 iterations in 1629 ms. Result :sat
Minimization took 185 ms.
[2023-03-22 18:03:32] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-22 18:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:32] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 18:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 18:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:33] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 18:03:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 42 ms returned sat
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-22 18:03:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 842 ms
[2023-03-22 18:03:33] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:34] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-22 18:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-22 18:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 18:03:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 25 ms returned sat
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 4 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2023-03-22 18:03:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 856 ms
[2023-03-22 18:03:35] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:35] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 18:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:35] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-22 18:03:35] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-22 18:03:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 461 ms
[2023-03-22 18:03:35] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 20 ms.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-22 18:03:36] [INFO ] Added : 93 causal constraints over 20 iterations in 501 ms. Result :sat
Minimization took 134 ms.
[2023-03-22 18:03:36] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:36] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 18:03:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:36] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-22 18:03:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 18 ms returned sat
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-22 18:03:36] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-22 18:03:37] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-22 18:03:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-22 18:03:37] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2023-03-22 18:03:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-22 18:03:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 611 ms
[2023-03-22 18:03:37] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:37] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 18:03:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:37] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:03:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2023-03-22 18:03:37] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2023-03-22 18:03:37] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-22 18:03:37] [INFO ] Added : 88 causal constraints over 18 iterations in 452 ms. Result :sat
Minimization took 128 ms.
[2023-03-22 18:03:38] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:38] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 18:03:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:38] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-22 18:03:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-22 18:03:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 579 ms
[2023-03-22 18:03:38] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:38] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-22 18:03:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 18:03:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 508 ms
[2023-03-22 18:03:39] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 18:03:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-22 18:03:40] [INFO ] Added : 78 causal constraints over 17 iterations in 526 ms. Result :sat
Minimization took 101 ms.
[2023-03-22 18:03:40] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:40] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 18:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:40] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 18:03:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2023-03-22 18:03:40] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2023-03-22 18:03:41] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:03:41] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:03:41] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:03:41] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2023-03-22 18:03:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 921 ms
Current structural bounds on expressions (after SMT) : [6, 30, 5, 6, 5, 6, 5, 6, 5] Max seen :[1, 30, 5, 4, 5, 4, 5, 4, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-04 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 44 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 170/176 places, 348/354 transitions.
Normalized transition count is 258 out of 348 initially.
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 18:03:41] [INFO ] Computed 50 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2174 ms. (steps per millisecond=459 ) properties (out of 4) seen :15
FORMULA LamportFastMutEx-COL-6-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 3) seen :7
[2023-03-22 18:03:45] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 18:03:45] [INFO ] Computed 50 place invariants in 8 ms
[2023-03-22 18:03:45] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:45] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 18:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 18:03:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:03:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:03:46] [INFO ] Computed and/alt/rep : 222/1134/222 causal constraints (skipped 30 transitions) in 19 ms.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-22 18:03:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 598 ms
[2023-03-22 18:03:46] [INFO ] Added : 87 causal constraints over 18 iterations in 973 ms. Result :sat
Minimization took 173 ms.
[2023-03-22 18:03:47] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:03:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-22 18:03:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-22 18:03:47] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 941 ms
[2023-03-22 18:03:48] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:48] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-22 18:03:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:48] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:03:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-22 18:03:48] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:03:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 876 ms
Current structural bounds on expressions (after SMT) : [6, 5, 5] Max seen :[1, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 342
Applied a total of 12 rules in 34 ms. Remains 164 /170 variables (removed 6) and now considering 342/348 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 164/170 places, 342/348 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 164 cols
[2023-03-22 18:03:49] [INFO ] Computed 50 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 1) seen :1
[2023-03-22 18:03:51] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-22 18:03:51] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-22 18:03:52] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:52] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-22 18:03:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 18:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:52] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-22 18:03:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:03:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:03:52] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 20 ms.
[2023-03-22 18:03:52] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-22 18:03:52] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-22 18:03:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:03:52] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:03:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 343 ms
[2023-03-22 18:03:52] [INFO ] Added : 38 causal constraints over 10 iterations in 560 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 12 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 18:03:52] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:03:52] [INFO ] Invariant cache hit.
[2023-03-22 18:03:53] [INFO ] Implicit Places using invariants in 148 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 150 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 170 ms. Remains : 158/164 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:03:53] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1773 ms. (steps per millisecond=564 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 1) seen :1
[2023-03-22 18:03:55] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:03:55] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-22 18:03:55] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:55] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:03:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 18:03:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:03:55] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-22 18:03:55] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2023-03-22 18:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-22 18:03:55] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 25 ms.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 18:03:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 732 ms
[2023-03-22 18:03:56] [INFO ] Added : 124 causal constraints over 25 iterations in 1242 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 18:03:57] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:03:57] [INFO ] Invariant cache hit.
[2023-03-22 18:03:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-22 18:03:57] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:03:57] [INFO ] Invariant cache hit.
[2023-03-22 18:03:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:03:57] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-22 18:03:57] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 18:03:57] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:03:57] [INFO ] Invariant cache hit.
[2023-03-22 18:03:57] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 158/158 places, 342/342 transitions.
Starting property specific reduction for LamportFastMutEx-COL-6-UpperBounds-02
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:03:57] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 18:03:57] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:03:57] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-22 18:03:57] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:03:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:03:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:03:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:03:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:03:58] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-22 18:03:58] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-22 18:03:58] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-22 18:03:58] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-22 18:03:58] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-22 18:03:58] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2023-03-22 18:03:58] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:03:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 18:03:59] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:03:59] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:03:59] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-22 18:03:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 18:03:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 771 ms
[2023-03-22 18:03:59] [INFO ] Added : 124 causal constraints over 25 iterations in 1267 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:03:59] [INFO ] Computed 44 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 1) seen :1
[2023-03-22 18:04:01] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:04:01] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-22 18:04:02] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:04:02] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 18:04:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:04:02] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:04:02] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 18:04:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:04:02] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-22 18:04:02] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-22 18:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-22 18:04:02] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 14 ms.
[2023-03-22 18:04:02] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2023-03-22 18:04:02] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:04:02] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-22 18:04:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 769 ms
[2023-03-22 18:04:03] [INFO ] Added : 124 causal constraints over 25 iterations in 1255 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 18:04:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:04:03] [INFO ] Invariant cache hit.
[2023-03-22 18:04:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-22 18:04:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:04:03] [INFO ] Invariant cache hit.
[2023-03-22 18:04:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:04:04] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-22 18:04:04] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 18:04:04] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:04:04] [INFO ] Invariant cache hit.
[2023-03-22 18:04:04] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 158/158 places, 342/342 transitions.
Ending property specific reduction for LamportFastMutEx-COL-6-UpperBounds-02 in 6514 ms.
[2023-03-22 18:04:04] [INFO ] Flatten gal took : 61 ms
[2023-03-22 18:04:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 18:04:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 342 transitions and 1638 arcs took 3 ms.
Total runtime 36018 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1158/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6447848 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092532 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
mcc2023
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-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LamportFastMutEx-COL-6, 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 r233-tall-167856418800373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 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 ;