About the Execution of ITS-LoLa for ShieldIIPs-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.510 | 3600000.00 | 307108.00 | 205.90 | ?TFTTTTTTTTTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477100167.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477100167
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 3.8K May 14 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 503K May 12 20:42 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 ShieldIIPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591291201535
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:20:03] [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]
[2020-06-04 17:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:20:03] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2020-06-04 17:20:03] [INFO ] Transformed 1803 places.
[2020-06-04 17:20:03] [INFO ] Transformed 1773 transitions.
[2020-06-04 17:20:03] [INFO ] Found NUPN structural information;
[2020-06-04 17:20:03] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties seen :[0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1773 rows 1803 cols
[2020-06-04 17:20:03] [INFO ] Computed 271 place invariants in 40 ms
[2020-06-04 17:20:04] [INFO ] [Real]Absence check using 271 positive place invariants in 293 ms returned sat
[2020-06-04 17:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:20:08] [INFO ] [Real]Absence check using state equation in 4441 ms returned (error "Failed to check-sat")
[2020-06-04 17:20:09] [INFO ] [Real]Absence check using 271 positive place invariants in 331 ms returned sat
[2020-06-04 17:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:20:13] [INFO ] [Real]Absence check using state equation in 4329 ms returned (error "Failed to check-sat")
[2020-06-04 17:20:14] [INFO ] [Real]Absence check using 271 positive place invariants in 230 ms returned sat
[2020-06-04 17:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:20:18] [INFO ] [Real]Absence check using state equation in 4504 ms returned (error "Failed to check-sat")
[2020-06-04 17:20:19] [INFO ] [Real]Absence check using 271 positive place invariants in 243 ms returned sat
[2020-06-04 17:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:23] [INFO ] [Real]Absence check using state equation in 4509 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 17:20:24] [INFO ] [Real]Absence check using 271 positive place invariants in 238 ms returned sat
[2020-06-04 17:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:20:28] [INFO ] [Real]Absence check using state equation in 4462 ms returned (error "Failed to check-sat")
Support contains 31 out of 1803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1803 transition count 1626
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 1656 transition count 1626
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 294 place count 1656 transition count 1476
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 594 place count 1506 transition count 1476
Symmetric choice reduction at 2 with 201 rule applications. Total rules 795 place count 1506 transition count 1476
Deduced a syphon composed of 201 places in 6 ms
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 1197 place count 1305 transition count 1275
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 1197 place count 1305 transition count 1194
Deduced a syphon composed of 81 places in 5 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 1359 place count 1224 transition count 1194
Performed 440 Post agglomeration using F-continuation condition.Transition count delta: 440
Deduced a syphon composed of 440 places in 5 ms
Reduce places removed 440 places and 0 transitions.
Iterating global reduction 2 with 880 rules applied. Total rules applied 2239 place count 784 transition count 754
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 2 with 202 rules applied. Total rules applied 2441 place count 784 transition count 754
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 2442 place count 784 transition count 754
Applied a total of 2442 rules in 702 ms. Remains 784 /1803 variables (removed 1019) and now considering 754/1773 (removed 1019) transitions.
Finished structural reductions, in 1 iterations. Remains : 784/1803 places, 754/1773 transitions.
Incomplete random walk after 1000000 steps, including 279 resets, run finished after 5854 ms. (steps per millisecond=170 ) properties seen :[0, 1, 1, 0, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 19 resets, run finished after 3188 ms. (steps per millisecond=313 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 3088 ms. (steps per millisecond=323 ) properties seen :[0, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 754 rows 784 cols
[2020-06-04 17:20:41] [INFO ] Computed 271 place invariants in 33 ms
[2020-06-04 17:20:42] [INFO ] [Real]Absence check using 267 positive place invariants in 228 ms returned sat
[2020-06-04 17:20:42] [INFO ] [Real]Absence check using 267 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 17:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:43] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2020-06-04 17:20:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:20:43] [INFO ] [Nat]Absence check using 267 positive place invariants in 116 ms returned sat
[2020-06-04 17:20:43] [INFO ] [Nat]Absence check using 267 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 17:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:20:44] [INFO ] [Nat]Absence check using state equation in 1287 ms returned sat
[2020-06-04 17:20:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-04 17:20:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 6 ms returned sat
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 7 places in 182 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 6 places in 55 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-06-04 17:20:45] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 5 places in 102 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2020-06-04 17:20:46] [INFO ] Deduced a trap composed of 11 places in 63 ms
[2020-06-04 17:20:46] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1887 ms
[2020-06-04 17:20:46] [INFO ] Computed and/alt/rep : 753/4619/753 causal constraints in 78 ms.
[2020-06-04 17:21:06] [INFO ] Added : 695 causal constraints over 139 iterations in 20133 ms.(timeout) Result :sat
[2020-06-04 17:21:07] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2020-06-04 17:21:07] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-06-04 17:21:07] [INFO ] Deduced a trap composed of 7 places in 120 ms
[2020-06-04 17:21:07] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2020-06-04 17:21:08] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-04 17:21:08] [INFO ] Deduced a trap composed of 10 places in 72 ms
[2020-06-04 17:21:08] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-06-04 17:21:08] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-06-04 17:21:09] [INFO ] Deduced a trap composed of 19 places in 149 ms
[2020-06-04 17:21:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2498 ms
Attempting to minimize the solution found.
Minimization took 164 ms.
Incomplete Parikh walk after 80300 steps, including 1000 resets, run finished after 684 ms. (steps per millisecond=117 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 784 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 784/784 places, 754/754 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 784 transition count 751
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 781 transition count 751
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 781 transition count 746
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 776 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 50 place count 759 transition count 729
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 759 transition count 729
Applied a total of 55 rules in 180 ms. Remains 759 /784 variables (removed 25) and now considering 729/754 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/784 places, 729/754 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5291 ms. (steps per millisecond=189 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 3101 ms. (steps per millisecond=322 ) properties seen :[0]
Interrupted probabilistic random walk after 3029356 steps, run timeout after 30001 ms. (steps per millisecond=100 ) properties seen :[0]
Probabilistic random walk after 3029356 steps, saw 402501 distinct states, run finished after 30001 ms. (steps per millisecond=100 ) properties seen :[0]
// Phase 1: matrix 729 rows 759 cols
[2020-06-04 17:21:48] [INFO ] Computed 271 place invariants in 26 ms
[2020-06-04 17:21:49] [INFO ] [Real]Absence check using 270 positive place invariants in 164 ms returned sat
[2020-06-04 17:21:49] [INFO ] [Real]Absence check using 270 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:21:50] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2020-06-04 17:21:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:21:50] [INFO ] [Nat]Absence check using 270 positive place invariants in 141 ms returned sat
[2020-06-04 17:21:50] [INFO ] [Nat]Absence check using 270 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:21:51] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2020-06-04 17:21:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-04 17:21:51] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 5 places in 43 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-06-04 17:21:52] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-06-04 17:21:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 523 ms
[2020-06-04 17:21:52] [INFO ] Computed and/alt/rep : 728/4673/728 causal constraints in 46 ms.
[2020-06-04 17:22:12] [INFO ] Added : 695 causal constraints over 139 iterations in 20291 ms.(timeout) Result :sat
[2020-06-04 17:22:12] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2020-06-04 17:22:13] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-06-04 17:22:13] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-04 17:22:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 777 ms
Attempting to minimize the solution found.
Minimization took 121 ms.
Incomplete Parikh walk after 81400 steps, including 1000 resets, run finished after 591 ms. (steps per millisecond=137 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 759 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 759/759 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 729/729 transitions.
Starting structural reductions, iteration 0 : 759/759 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 759 /759 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 759 cols
[2020-06-04 17:22:14] [INFO ] Computed 271 place invariants in 30 ms
[2020-06-04 17:22:16] [INFO ] Implicit Places using invariants in 1656 ms returned [745]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1658 ms to find 1 implicit places.
[2020-06-04 17:22:16] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:22:16] [INFO ] Computed 270 place invariants in 5 ms
[2020-06-04 17:22:17] [INFO ] Dead Transitions using invariants and state equation in 1251 ms returned []
Starting structural reductions, iteration 1 : 758/759 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2020-06-04 17:22:17] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:22:17] [INFO ] Computed 270 place invariants in 5 ms
[2020-06-04 17:22:18] [INFO ] Dead Transitions using invariants and state equation in 1272 ms returned []
Finished structural reductions, in 2 iterations. Remains : 758/759 places, 729/729 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 4391 ms. (steps per millisecond=227 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2999 ms. (steps per millisecond=333 ) properties seen :[0]
Interrupted probabilistic random walk after 3031299 steps, run timeout after 30001 ms. (steps per millisecond=101 ) properties seen :[0]
Probabilistic random walk after 3031299 steps, saw 405053 distinct states, run finished after 30003 ms. (steps per millisecond=101 ) properties seen :[0]
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:22:56] [INFO ] Computed 270 place invariants in 12 ms
[2020-06-04 17:22:56] [INFO ] [Real]Absence check using 269 positive place invariants in 109 ms returned sat
[2020-06-04 17:22:56] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-04 17:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:22:57] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2020-06-04 17:22:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:22:57] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-04 17:22:57] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-06-04 17:22:57] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-06-04 17:22:57] [INFO ] Deduced a trap composed of 6 places in 103 ms
[2020-06-04 17:22:57] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-06-04 17:22:57] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 7 places in 45 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 11 places in 38 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 7 places in 50 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 14 places in 34 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2020-06-04 17:22:58] [INFO ] Deduced a trap composed of 13 places in 30 ms
[2020-06-04 17:22:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1087 ms
[2020-06-04 17:22:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:22:58] [INFO ] [Nat]Absence check using 269 positive place invariants in 117 ms returned sat
[2020-06-04 17:22:58] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 17:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:22:59] [INFO ] [Nat]Absence check using state equation in 989 ms returned sat
[2020-06-04 17:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-04 17:22:59] [INFO ] Deduced a trap composed of 11 places in 93 ms
[2020-06-04 17:22:59] [INFO ] Deduced a trap composed of 14 places in 65 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 13 places in 48 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 6 places in 52 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 16 places in 42 ms
[2020-06-04 17:23:00] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2020-06-04 17:23:01] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-06-04 17:23:01] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-04 17:23:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1371 ms
[2020-06-04 17:23:01] [INFO ] Computed and/alt/rep : 728/4669/728 causal constraints in 32 ms.
[2020-06-04 17:23:24] [INFO ] Added : 703 causal constraints over 141 iterations in 23705 ms.(timeout) Result :unknown
Incomplete Parikh walk after 48300 steps, including 1000 resets, run finished after 327 ms. (steps per millisecond=147 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 758 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 758/758 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 729/729 transitions.
Starting structural reductions, iteration 0 : 758/758 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:23:25] [INFO ] Computed 270 place invariants in 5 ms
[2020-06-04 17:23:26] [INFO ] Implicit Places using invariants in 1330 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:23:26] [INFO ] Computed 270 place invariants in 5 ms
[2020-06-04 17:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:23:33] [INFO ] Implicit Places using invariants and state equation in 7035 ms returned []
Implicit Place search using SMT with State Equation took 8379 ms to find 0 implicit places.
[2020-06-04 17:23:33] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:23:33] [INFO ] Computed 270 place invariants in 25 ms
[2020-06-04 17:23:35] [INFO ] Dead Transitions using invariants and state equation in 1791 ms returned []
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 729/729 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 468 ms. (steps per millisecond=213 ) properties seen :[0]
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:23:35] [INFO ] Computed 270 place invariants in 6 ms
[2020-06-04 17:23:36] [INFO ] [Real]Absence check using 269 positive place invariants in 114 ms returned sat
[2020-06-04 17:23:36] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:23:37] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2020-06-04 17:23:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:23:37] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 6 places in 47 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 7 places in 46 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 7 places in 51 ms
[2020-06-04 17:23:37] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-06-04 17:23:38] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2020-06-04 17:23:38] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2020-06-04 17:23:38] [INFO ] Deduced a trap composed of 14 places in 54 ms
[2020-06-04 17:23:38] [INFO ] Deduced a trap composed of 17 places in 41 ms
[2020-06-04 17:23:38] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2020-06-04 17:23:38] [INFO ] Deduced a trap composed of 13 places in 30 ms
[2020-06-04 17:23:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1100 ms
[2020-06-04 17:23:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:23:38] [INFO ] [Nat]Absence check using 269 positive place invariants in 146 ms returned sat
[2020-06-04 17:23:38] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:23:39] [INFO ] [Nat]Absence check using state equation in 1058 ms returned sat
[2020-06-04 17:23:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-04 17:23:39] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2020-06-04 17:23:39] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2020-06-04 17:23:39] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-06-04 17:23:39] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 7 places in 51 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 13 places in 46 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 6 places in 51 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 6 places in 47 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 11 places in 37 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 7 places in 39 ms
[2020-06-04 17:23:40] [INFO ] Deduced a trap composed of 16 places in 38 ms
[2020-06-04 17:23:40] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1133 ms
[2020-06-04 17:23:40] [INFO ] Computed and/alt/rep : 728/4669/728 causal constraints in 30 ms.
[2020-06-04 17:23:58] [INFO ] Added : 675 causal constraints over 135 iterations in 17580 ms. Result :unknown
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 729
Applied a total of 1 rules in 53 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 758 cols
[2020-06-04 17:23:58] [INFO ] Computed 270 place invariants in 9 ms
[2020-06-04 17:23:59] [INFO ] [Real]Absence check using 269 positive place invariants in 581 ms returned sat
[2020-06-04 17:23:59] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:24:00] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2020-06-04 17:24:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:24:00] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-04 17:24:00] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-04 17:24:00] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-06-04 17:24:00] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2020-06-04 17:24:00] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2020-06-04 17:24:01] [INFO ] Deduced a trap composed of 9 places in 546 ms
[2020-06-04 17:24:01] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2020-06-04 17:24:01] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-04 17:24:01] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-04 17:24:01] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-04 17:24:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1372 ms
[2020-06-04 17:24:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:24:02] [INFO ] [Nat]Absence check using 269 positive place invariants in 122 ms returned sat
[2020-06-04 17:24:02] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:24:03] [INFO ] [Nat]Absence check using state equation in 1503 ms returned sat
[2020-06-04 17:24:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-04 17:24:03] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-06-04 17:24:03] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2020-06-04 17:24:03] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 16 places in 80 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 11 places in 56 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 13 places in 45 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 13 places in 47 ms
[2020-06-04 17:24:04] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2020-06-04 17:24:05] [INFO ] Deduced a trap composed of 12 places in 55 ms
[2020-06-04 17:24:05] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-06-04 17:24:05] [INFO ] Deduced a trap composed of 22 places in 57 ms
[2020-06-04 17:24:05] [INFO ] Deduced a trap composed of 24 places in 58 ms
[2020-06-04 17:24:05] [INFO ] Deduced a trap composed of 25 places in 68 ms
[2020-06-04 17:24:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1748 ms
[2020-06-04 17:24:05] [INFO ] Computed and/alt/rep : 728/4669/728 causal constraints in 43 ms.
[2020-06-04 17:24:25] [INFO ] Added : 685 causal constraints over 137 iterations in 20136 ms.(timeout) Result :sat
[2020-06-04 17:24:25] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-06-04 17:24:25] [INFO ] Deduced a trap composed of 10 places in 38 ms
[2020-06-04 17:24:26] [INFO ] Deduced a trap composed of 13 places in 40 ms
[2020-06-04 17:24:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 728 ms
Attempting to minimize the solution found.
Minimization took 135 ms.
[2020-06-04 17:24:26] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-04 17:24:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 25 ms.
[2020-06-04 17:24:26] [INFO ] Flatten gal took : 195 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-030B @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldIIPs-PT-030B
{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:24:27 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 24284,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"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": "E (F (((1 <= p365) AND (1 <= p374) AND (1 <= p380) AND (1 <= p660) AND ((p446 <= 0) OR ((1 <= p1))) AND (((1 <= p323)) OR ((1 <= p397))))))",
"processed_size": 141,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3695,
"conflict_clusters": 100,
"places": 758,
"places_significant": 488,
"singleton_clusters": 0,
"transitions": 729
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 1487/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24256
lola: finding significant places
lola: 758 places, 729 transitions, 488 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: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p660 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: E (F (((1 <= p365) AND (1 <= p374) AND (1 <= p380) AND (1 <= p660) AND ((p446 <= 0) OR ((1 <= p1))) AND (((1 <= p323)) OR ((1 <= p397))))))
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 <= p365) AND (1 <= p374) AND (1 <= p380) AND (1 <= p660) AND ((p446 <= 0) OR ((1 <= p1))) AND (((1 <= p323)) OR ((1 <= p397))))))
lola: processed formula length: 141
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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: formula 0: ((1 <= p365) AND (1 <= p374) AND (1 <= p380) AND (1 <= p660) AND ((p446 <= 0) OR ((1 <= p1))) AND (((1 <= p323)) OR ((1 <= p397))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 4 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.
lola: memory consumption: 24284 KB
lola: time consumption: 4 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="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is ShieldIIPs-PT-030B, 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 r211-tajo-159033477100167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-PT-030B 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 ;