About the Execution of 2020-gold for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4284.560 | 3600000.00 | 256546.00 | 743.40 | TTTTFTTTTFTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100048.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DES-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100048
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 91K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20b-ReachabilityFireability-00
FORMULA_NAME DES-PT-20b-ReachabilityFireability-01
FORMULA_NAME DES-PT-20b-ReachabilityFireability-02
FORMULA_NAME DES-PT-20b-ReachabilityFireability-03
FORMULA_NAME DES-PT-20b-ReachabilityFireability-04
FORMULA_NAME DES-PT-20b-ReachabilityFireability-05
FORMULA_NAME DES-PT-20b-ReachabilityFireability-06
FORMULA_NAME DES-PT-20b-ReachabilityFireability-07
FORMULA_NAME DES-PT-20b-ReachabilityFireability-08
FORMULA_NAME DES-PT-20b-ReachabilityFireability-09
FORMULA_NAME DES-PT-20b-ReachabilityFireability-10
FORMULA_NAME DES-PT-20b-ReachabilityFireability-11
FORMULA_NAME DES-PT-20b-ReachabilityFireability-12
FORMULA_NAME DES-PT-20b-ReachabilityFireability-13
FORMULA_NAME DES-PT-20b-ReachabilityFireability-14
FORMULA_NAME DES-PT-20b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620506483093
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:41:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 20:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:41:24] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-08 20:41:24] [INFO ] Transformed 360 places.
[2021-05-08 20:41:24] [INFO ] Transformed 311 transitions.
[2021-05-08 20:41:24] [INFO ] Found NUPN structural information;
[2021-05-08 20:41:24] [INFO ] Parsed PT model containing 360 places and 311 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 311 rows 360 cols
[2021-05-08 20:41:24] [INFO ] Computed 65 place invariants in 25 ms
[2021-05-08 20:41:25] [INFO ] [Real]Absence check using 39 positive place invariants in 42 ms returned sat
[2021-05-08 20:41:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2021-05-08 20:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:25] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-08 20:41:25] [INFO ] Deduced a trap composed of 10 places in 119 ms
[2021-05-08 20:41:25] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2021-05-08 20:41:25] [INFO ] Deduced a trap composed of 10 places in 52 ms
[2021-05-08 20:41:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2021-05-08 20:41:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 38 ms returned sat
[2021-05-08 20:41:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2021-05-08 20:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:26] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2021-05-08 20:41:26] [INFO ] Deduced a trap composed of 13 places in 99 ms
[2021-05-08 20:41:26] [INFO ] Deduced a trap composed of 18 places in 85 ms
[2021-05-08 20:41:26] [INFO ] Deduced a trap composed of 18 places in 68 ms
[2021-05-08 20:41:27] [INFO ] Deduced a trap composed of 15 places in 63 ms
[2021-05-08 20:41:27] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2021-05-08 20:41:27] [INFO ] Deduced a trap composed of 17 places in 60 ms
[2021-05-08 20:41:27] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2021-05-08 20:41:27] [INFO ] Deduced a trap composed of 13 places in 49 ms
[2021-05-08 20:41:27] [INFO ] Deduced a trap composed of 14 places in 46 ms
[2021-05-08 20:41:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 758 ms
[2021-05-08 20:41:27] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 30 ms.
[2021-05-08 20:41:29] [INFO ] Added : 276 causal constraints over 56 iterations in 1703 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 20:41:29] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2021-05-08 20:41:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2021-05-08 20:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:29] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2021-05-08 20:41:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2021-05-08 20:41:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2021-05-08 20:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:30] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 20 places in 66 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 17 places in 65 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2021-05-08 20:41:30] [INFO ] Deduced a trap composed of 24 places in 59 ms
[2021-05-08 20:41:31] [INFO ] Deduced a trap composed of 10 places in 55 ms
[2021-05-08 20:41:31] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2021-05-08 20:41:31] [INFO ] Deduced a trap composed of 30 places in 53 ms
[2021-05-08 20:41:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 860 ms
[2021-05-08 20:41:31] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 16 ms.
[2021-05-08 20:41:32] [INFO ] Added : 250 causal constraints over 50 iterations in 1175 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 20:41:32] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2021-05-08 20:41:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2021-05-08 20:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:32] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2021-05-08 20:41:32] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2021-05-08 20:41:33] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2021-05-08 20:41:33] [INFO ] Deduced a trap composed of 36 places in 83 ms
[2021-05-08 20:41:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2021-05-08 20:41:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 27 ms returned sat
[2021-05-08 20:41:33] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2021-05-08 20:41:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:33] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2021-05-08 20:41:33] [INFO ] Deduced a trap composed of 33 places in 96 ms
[2021-05-08 20:41:33] [INFO ] Deduced a trap composed of 36 places in 93 ms
[2021-05-08 20:41:33] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2021-05-08 20:41:34] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2021-05-08 20:41:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 434 ms
[2021-05-08 20:41:34] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 15 ms.
[2021-05-08 20:41:35] [INFO ] Added : 295 causal constraints over 59 iterations in 1379 ms. Result :sat
[2021-05-08 20:41:35] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2021-05-08 20:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 20:41:35] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2021-05-08 20:41:35] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 28 ms returned sat
[2021-05-08 20:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:36] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2021-05-08 20:41:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2021-05-08 20:41:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2021-05-08 20:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:36] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2021-05-08 20:41:36] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2021-05-08 20:41:37] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2021-05-08 20:41:37] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2021-05-08 20:41:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 245 ms
[2021-05-08 20:41:37] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 18 ms.
[2021-05-08 20:41:39] [INFO ] Added : 260 causal constraints over 53 iterations in 1865 ms. Result :sat
[2021-05-08 20:41:39] [INFO ] Deduced a trap composed of 55 places in 85 ms
[2021-05-08 20:41:39] [INFO ] Deduced a trap composed of 64 places in 81 ms
[2021-05-08 20:41:39] [INFO ] Deduced a trap composed of 52 places in 87 ms
[2021-05-08 20:41:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 414 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 20:41:39] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2021-05-08 20:41:39] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 28 ms returned sat
[2021-05-08 20:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:40] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2021-05-08 20:41:40] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2021-05-08 20:41:40] [INFO ] Deduced a trap composed of 16 places in 101 ms
[2021-05-08 20:41:40] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2021-05-08 20:41:40] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2021-05-08 20:41:40] [INFO ] Deduced a trap composed of 20 places in 99 ms
[2021-05-08 20:41:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 589 ms
[2021-05-08 20:41:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:41:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 20:41:40] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2021-05-08 20:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:41:41] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2021-05-08 20:41:41] [INFO ] Deduced a trap composed of 8 places in 73 ms
[2021-05-08 20:41:41] [INFO ] Deduced a trap composed of 21 places in 36 ms
[2021-05-08 20:41:41] [INFO ] Deduced a trap composed of 27 places in 98 ms
[2021-05-08 20:41:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2021-05-08 20:41:41] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 16 ms.
[2021-05-08 20:41:43] [INFO ] Added : 297 causal constraints over 61 iterations in 1657 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 296000 steps, including 3160 resets, run finished after 882 ms. (steps per millisecond=335 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 169400 steps, including 1877 resets, run finished after 479 ms. (steps per millisecond=353 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 277800 steps, including 3062 resets, run finished after 790 ms. (steps per millisecond=351 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 123600 steps, including 1350 resets, run finished after 357 ms. (steps per millisecond=346 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 19300 steps, including 231 resets, run finished after 57 ms. (steps per millisecond=338 ) properties seen :[1, 0, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-20b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 24 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 349 transition count 287
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 332 transition count 287
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 332 transition count 278
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 323 transition count 278
Symmetric choice reduction at 2 with 17 rule applications. Total rules 72 place count 323 transition count 278
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 306 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 306 transition count 260
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 305 transition count 260
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 305 transition count 260
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 144 place count 293 transition count 248
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 157 place count 293 transition count 235
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 160 place count 291 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 160 place count 291 transition count 232
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 289 transition count 232
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 288 place count 227 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 292 place count 225 transition count 175
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 225 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 296 place count 223 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 297 place count 223 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 222 transition count 172
Applied a total of 298 rules in 125 ms. Remains 222 /360 variables (removed 138) and now considering 172/311 (removed 139) transitions.
Finished structural reductions, in 1 iterations. Remains : 222/360 places, 172/311 transitions.
Incomplete random walk after 1000000 steps, including 25927 resets, run finished after 2940 ms. (steps per millisecond=340 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4689 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4648 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5787 resets, run finished after 1388 ms. (steps per millisecond=720 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4645 resets, run finished after 1266 ms. (steps per millisecond=789 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 17080970 steps, run timeout after 30001 ms. (steps per millisecond=569 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 17080970 steps, saw 1985010 distinct states, run finished after 30001 ms. (steps per millisecond=569 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 172 rows 222 cols
[2021-05-08 20:42:23] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 20:42:23] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2021-05-08 20:42:23] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 20:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:24] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-08 20:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:42:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 20:42:24] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-08 20:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:24] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-08 20:42:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 20:42:24] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2021-05-08 20:42:24] [INFO ] Deduced a trap composed of 11 places in 13 ms
[2021-05-08 20:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-08 20:42:24] [INFO ] Computed and/alt/rep : 171/1008/171 causal constraints in 9 ms.
[2021-05-08 20:42:25] [INFO ] Added : 131 causal constraints over 27 iterations in 623 ms. Result :sat
[2021-05-08 20:42:25] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2021-05-08 20:42:25] [INFO ] Deduced a trap composed of 13 places in 34 ms
[2021-05-08 20:42:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 20:42:25] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2021-05-08 20:42:25] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:25] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-08 20:42:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:42:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 20:42:25] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 51 ms returned sat
[2021-05-08 20:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:25] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-08 20:42:25] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:42:25] [INFO ] Computed and/alt/rep : 171/1008/171 causal constraints in 10 ms.
[2021-05-08 20:42:26] [INFO ] Added : 165 causal constraints over 33 iterations in 570 ms. Result :sat
[2021-05-08 20:42:26] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2021-05-08 20:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 20:42:26] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-08 20:42:26] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:42:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:26] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-08 20:42:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:42:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 20:42:26] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-08 20:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:26] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-08 20:42:26] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2021-05-08 20:42:26] [INFO ] Computed and/alt/rep : 171/1008/171 causal constraints in 9 ms.
[2021-05-08 20:42:27] [INFO ] Added : 128 causal constraints over 26 iterations in 717 ms. Result :sat
[2021-05-08 20:42:27] [INFO ] Deduced a trap composed of 23 places in 43 ms
[2021-05-08 20:42:27] [INFO ] Deduced a trap composed of 16 places in 42 ms
[2021-05-08 20:42:27] [INFO ] Deduced a trap composed of 24 places in 42 ms
[2021-05-08 20:42:27] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2021-05-08 20:42:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 254 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 20:42:28] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2021-05-08 20:42:28] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:28] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-08 20:42:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:42:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 20:42:28] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2021-05-08 20:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:42:28] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-08 20:42:28] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2021-05-08 20:42:28] [INFO ] Computed and/alt/rep : 171/1008/171 causal constraints in 10 ms.
[2021-05-08 20:42:29] [INFO ] Added : 150 causal constraints over 31 iterations in 783 ms. Result :sat
[2021-05-08 20:42:29] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2021-05-08 20:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 70900 steps, including 1625 resets, run finished after 220 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 70900 steps, including 1337 resets, run finished after 222 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 112000 steps, including 2313 resets, run finished after 346 ms. (steps per millisecond=323 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 74000 steps, including 1437 resets, run finished after 230 ms. (steps per millisecond=321 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 222 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 222/222 places, 172/172 transitions.
Applied a total of 0 rules in 8 ms. Remains 222 /222 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 222/222 places, 172/172 transitions.
Starting structural reductions, iteration 0 : 222/222 places, 172/172 transitions.
Applied a total of 0 rules in 11 ms. Remains 222 /222 variables (removed 0) and now considering 172/172 (removed 0) transitions.
// Phase 1: matrix 172 rows 222 cols
[2021-05-08 20:42:30] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 20:42:30] [INFO ] Implicit Places using invariants in 302 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 303 ms to find 1 implicit places.
[2021-05-08 20:42:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:42:30] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:42:31] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Starting structural reductions, iteration 1 : 221/222 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2021-05-08 20:42:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:42:31] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:42:31] [INFO ] Dead Transitions using invariants and state equation in 261 ms returned []
Finished structural reductions, in 2 iterations. Remains : 221/222 places, 172/172 transitions.
Incomplete random walk after 1000000 steps, including 25842 resets, run finished after 2866 ms. (steps per millisecond=348 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4813 resets, run finished after 1162 ms. (steps per millisecond=860 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4773 resets, run finished after 1060 ms. (steps per millisecond=943 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5810 resets, run finished after 1350 ms. (steps per millisecond=740 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4593 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 17025951 steps, run timeout after 30001 ms. (steps per millisecond=567 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 17025951 steps, saw 1978653 distinct states, run finished after 30001 ms. (steps per millisecond=567 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:43:09] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:43:09] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:43:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:09] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-08 20:43:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:43:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 20:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:09] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-08 20:43:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-08 20:43:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:43:09] [INFO ] Deduced a trap composed of 6 places in 33 ms
[2021-05-08 20:43:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-08 20:43:09] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:10] [INFO ] Added : 133 causal constraints over 28 iterations in 650 ms. Result :sat
[2021-05-08 20:43:10] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2021-05-08 20:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 20:43:10] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:43:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:10] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-08 20:43:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 20:43:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2021-05-08 20:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:10] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-08 20:43:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2021-05-08 20:43:10] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2021-05-08 20:43:11] [INFO ] Deduced a trap composed of 10 places in 81 ms
[2021-05-08 20:43:11] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-08 20:43:11] [INFO ] Deduced a trap composed of 11 places in 41 ms
[2021-05-08 20:43:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 299 ms
[2021-05-08 20:43:11] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:11] [INFO ] Added : 165 causal constraints over 34 iterations in 807 ms. Result :sat
[2021-05-08 20:43:11] [INFO ] Deduced a trap composed of 13 places in 45 ms
[2021-05-08 20:43:12] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2021-05-08 20:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 20:43:12] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:43:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:12] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-08 20:43:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:43:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:12] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-08 20:43:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2021-05-08 20:43:12] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:13] [INFO ] Added : 132 causal constraints over 27 iterations in 558 ms. Result :sat
[2021-05-08 20:43:13] [INFO ] Deduced a trap composed of 23 places in 37 ms
[2021-05-08 20:43:13] [INFO ] Deduced a trap composed of 23 places in 34 ms
[2021-05-08 20:43:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 20:43:13] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:43:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:13] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-08 20:43:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 20:43:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2021-05-08 20:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:14] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-08 20:43:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2021-05-08 20:43:14] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:15] [INFO ] Added : 158 causal constraints over 32 iterations in 953 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 62600 steps, including 1262 resets, run finished after 194 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 92500 steps, including 1939 resets, run finished after 284 ms. (steps per millisecond=325 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 108800 steps, including 2355 resets, run finished after 332 ms. (steps per millisecond=327 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40200 steps, including 761 resets, run finished after 128 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 172/172 transitions.
Starting structural reductions, iteration 0 : 221/221 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 172/172 (removed 0) transitions.
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:43:16] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:43:16] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:43:16] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 20:43:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-08 20:43:17] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2021-05-08 20:43:17] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:43:17] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:43:17] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 172/172 transitions.
Incomplete random walk after 100000 steps, including 2607 resets, run finished after 291 ms. (steps per millisecond=343 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:43:17] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:43:17] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:43:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:17] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-08 20:43:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:43:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 20:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:18] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-08 20:43:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-08 20:43:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:43:18] [INFO ] Deduced a trap composed of 6 places in 36 ms
[2021-05-08 20:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-08 20:43:18] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:18] [INFO ] Added : 133 causal constraints over 28 iterations in 676 ms. Result :sat
[2021-05-08 20:43:18] [INFO ] Deduced a trap composed of 20 places in 40 ms
[2021-05-08 20:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-08 20:43:19] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:43:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-08 20:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:19] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-08 20:43:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 20:43:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-08 20:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:19] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-08 20:43:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2021-05-08 20:43:19] [INFO ] Deduced a trap composed of 11 places in 65 ms
[2021-05-08 20:43:19] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-08 20:43:19] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2021-05-08 20:43:19] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2021-05-08 20:43:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2021-05-08 20:43:19] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:20] [INFO ] Added : 165 causal constraints over 34 iterations in 796 ms. Result :sat
[2021-05-08 20:43:20] [INFO ] Deduced a trap composed of 13 places in 43 ms
[2021-05-08 20:43:20] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2021-05-08 20:43:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2021-05-08 20:43:20] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:43:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:21] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2021-05-08 20:43:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 20:43:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:21] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-08 20:43:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2021-05-08 20:43:21] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:21] [INFO ] Added : 132 causal constraints over 27 iterations in 579 ms. Result :sat
[2021-05-08 20:43:21] [INFO ] Deduced a trap composed of 23 places in 33 ms
[2021-05-08 20:43:21] [INFO ] Deduced a trap composed of 23 places in 31 ms
[2021-05-08 20:43:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2021-05-08 20:43:22] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:43:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:22] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-08 20:43:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:43:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2021-05-08 20:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:22] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-08 20:43:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2021-05-08 20:43:22] [INFO ] Computed and/alt/rep : 171/996/171 causal constraints in 9 ms.
[2021-05-08 20:43:23] [INFO ] Added : 158 causal constraints over 32 iterations in 935 ms. Result :sat
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 172/172 (removed 0) transitions.
// Phase 1: matrix 172 rows 221 cols
[2021-05-08 20:43:23] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 20:43:23] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 20:43:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:23] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-08 20:43:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:43:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2021-05-08 20:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:24] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-08 20:43:24] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2021-05-08 20:43:24] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2021-05-08 20:43:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2021-05-08 20:43:24] [INFO ] Computed and/alt/rep : 171/966/171 causal constraints in 9 ms.
[2021-05-08 20:43:24] [INFO ] Added : 132 causal constraints over 27 iterations in 645 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 20:43:24] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:43:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-08 20:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:25] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-08 20:43:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 20:43:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2021-05-08 20:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:25] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-08 20:43:25] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2021-05-08 20:43:25] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-08 20:43:25] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-08 20:43:25] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2021-05-08 20:43:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2021-05-08 20:43:25] [INFO ] Computed and/alt/rep : 171/966/171 causal constraints in 9 ms.
[2021-05-08 20:43:26] [INFO ] Added : 166 causal constraints over 34 iterations in 642 ms. Result :sat
[2021-05-08 20:43:26] [INFO ] Deduced a trap composed of 25 places in 37 ms
[2021-05-08 20:43:26] [INFO ] Deduced a trap composed of 24 places in 37 ms
[2021-05-08 20:43:26] [INFO ] Deduced a trap composed of 13 places in 41 ms
[2021-05-08 20:43:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 20:43:26] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-08 20:43:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 20:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:26] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2021-05-08 20:43:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 20:43:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:27] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-08 20:43:27] [INFO ] Deduced a trap composed of 10 places in 29 ms
[2021-05-08 20:43:27] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2021-05-08 20:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2021-05-08 20:43:27] [INFO ] Computed and/alt/rep : 171/966/171 causal constraints in 10 ms.
[2021-05-08 20:43:27] [INFO ] Added : 120 causal constraints over 24 iterations in 472 ms. Result :sat
[2021-05-08 20:43:27] [INFO ] Deduced a trap composed of 24 places in 26 ms
[2021-05-08 20:43:27] [INFO ] Deduced a trap composed of 23 places in 26 ms
[2021-05-08 20:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 20:43:27] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 20:43:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 20:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:28] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-08 20:43:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:43:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 20:43:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2021-05-08 20:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:43:28] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-08 20:43:28] [INFO ] Computed and/alt/rep : 171/966/171 causal constraints in 9 ms.
[2021-05-08 20:43:29] [INFO ] Added : 156 causal constraints over 32 iterations in 1056 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 20:43:29] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-08 20:43:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
[2021-05-08 20:43:29] [INFO ] Flatten gal took : 48 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-20b @ 3570 seconds
FORMULA DES-PT-20b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-20b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-20b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3513
rslt: Output for ReachabilityFireability @ DES-PT-20b
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 20:43:30 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p6) AND (1 <= p125))))",
"processed_size": 35,
"rewrites": 1
},
"result":
{
"edges": 23419757,
"markings": 17248815,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1171
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p17) AND (1 <= p125) AND ((p88 <= 0)) AND ((p137 <= 0)) AND ((p208 <= 0) OR (p213 <= 0)))))",
"processed_size": 105,
"rewrites": 1
},
"result":
{
"edges": 26599,
"markings": 21700,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1757
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p191 <= 0) OR (p193 <= 0) OR (((p31 <= 0) OR (p216 <= 0)) AND ((p47 <= 0) OR (p121 <= 0))) OR (((p116 <= 0)) AND ((p154 <= 0))))))",
"processed_size": 143,
"rewrites": 2
},
"result":
{
"edges": 3860,
"markings": 3134,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3514
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((p77 <= 0) OR (p90 <= 0) OR (((p1 <= 0)) AND ((p133 <= 0) OR (p212 <= 0))) OR ((1 <= p162) AND (1 <= p180) AND ((p124 <= 0) OR (p114 <= 0))))))",
"processed_size": 155,
"rewrites": 2
},
"result":
{
"edges": 327271,
"markings": 219386,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 29,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 26700,
"runtime": 57.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 819,
"conflict_clusters": 69,
"places": 221,
"places_significant": 161,
"singleton_clusters": 0,
"transitions": 172
},
"result":
{
"preliminary_value": "yes yes no no ",
"value": "yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 393/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 221
lola: finding significant places
lola: 221 places, 172 transitions, 161 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: E (F (((1 <= p17) AND (1 <= p125) AND ((p88 <= 0)) AND ((p137 <= 0)) AND ((p208 <= 0) OR (p213 <= 0))))) : E (F (((1 <= p6) AND (1 <= p125)))) : A (G (((p77 <= 0) OR (p90 <= 0) OR (((p1 <= 0)) AND ((p133 <= 0) OR (p212 <= 0))) OR ((1 <= p162) AND (1 <= p180) AND ((p124 <= 0) OR (p114 <= 0)))))) : A (G (((p191 <= 0) OR (p193 <= 0) OR (((p31 <= 0) OR (p216 <= 0)) AND ((p47 <= 0) OR (p121 <= 0))) OR (((p116 <= 0)) AND ((p154 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p6) AND (1 <= p125))))
lola: processed formula length: 35
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p125))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1722316 markings, 2313598 edges, 344463 markings/sec, 0 secs
lola: sara is running 5 secs || 3405022 markings, 4574402 edges, 336541 markings/sec, 5 secs
lola: sara is running 10 secs || 5041479 markings, 6836885 edges, 327291 markings/sec, 10 secs
lola: sara is running 15 secs || 6679852 markings, 9068026 edges, 327675 markings/sec, 15 secs
lola: sara is running 20 secs || 8292204 markings, 11264361 edges, 322470 markings/sec, 20 secs
lola: sara is running 25 secs || 9891603 markings, 13433095 edges, 319880 markings/sec, 25 secs
lola: sara is running 30 secs || 11475000 markings, 15597611 edges, 316679 markings/sec, 30 secs
lola: sara is running 35 secs || 13064821 markings, 17755763 edges, 317964 markings/sec, 35 secs
lola: sara is running 40 secs || 14672742 markings, 19927837 edges, 321584 markings/sec, 40 secs
lola: sara is running 45 secs || 16298841 markings, 22129532 edges, 325220 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17248815 markings, 23419757 edges
lola: ========================================
lola: subprocess 1 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p17) AND (1 <= p125) AND ((p88 <= 0)) AND ((p137 <= 0)) AND ((p208 <= 0) OR (p213 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p17) AND (1 <= p125) AND ((p88 <= 0)) AND ((p137 <= 0)) AND ((p208 <= 0) OR (p213 <= 0)))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p17) AND (1 <= p125) AND ((p88 <= 0)) AND ((p137 <= 0)) AND ((p208 <= 0) OR (p213 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21700 markings, 26599 edges
lola: ========================================
lola: subprocess 2 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p191 <= 0) OR (p193 <= 0) OR (((p31 <= 0) OR (p216 <= 0)) AND ((p47 <= 0) OR (p121 <= 0))) OR (((p116 <= 0)) AND ((p154 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p191 <= 0) OR (p193 <= 0) OR (((p31 <= 0) OR (p216 <= 0)) AND ((p47 <= 0) OR (p121 <= 0))) OR (((p116 <= 0)) AND ((p154 <= 0))))))
lola: processed formula length: 143
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p191) AND (1 <= p193) AND (((1 <= p31) AND (1 <= p216)) OR ((1 <= p47) AND (1 <= p121))) AND (((1 <= p116)) OR ((1 <= p154))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3134 markings, 3860 edges
lola: ========================================
lola: subprocess 3 will run for 3514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p77 <= 0) OR (p90 <= 0) OR (((p1 <= 0)) AND ((p133 <= 0) OR (p212 <= 0))) OR ((1 <= p162) AND (1 <= p180) AND ((p124 <= 0) OR (p114 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p77 <= 0) OR (p90 <= 0) OR (((p1 <= 0)) AND ((p133 <= 0) OR (p212 <= 0))) OR ((1 <= p162) AND (1 <= p180) AND ((p124 <= 0) OR (p114 <= 0))))))
lola: processed formula length: 155
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p77) AND (1 <= p90) AND (((1 <= p1)) OR ((1 <= p133) AND (1 <= p212))) AND ((p162 <= 0) OR (p180 <= 0) OR ((1 <= p124) AND (1 <= p114))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 29 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 219386 markings, 327271 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no
lola:
preliminary result: yes yes no no
lola: memory consumption: 26700 KB
lola: time consumption: 57 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
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="DES-PT-20b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is DES-PT-20b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;