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-159033477100166.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477100166
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591290979647

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:16:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 17:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:16:21] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2020-06-04 17:16:21] [INFO ] Transformed 1803 places.
[2020-06-04 17:16:21] [INFO ] Transformed 1773 transitions.
[2020-06-04 17:16:21] [INFO ] Found NUPN structural information;
[2020-06-04 17:16:21] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 1, 0, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[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]
// Phase 1: matrix 1773 rows 1803 cols
[2020-06-04 17:16:21] [INFO ] Computed 271 place invariants in 43 ms
[2020-06-04 17:16:22] [INFO ] [Real]Absence check using 271 positive place invariants in 236 ms returned sat
[2020-06-04 17:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:16:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:16:27] [INFO ] [Real]Absence check using state equation in 4512 ms returned (error "Failed to check-sat")
[2020-06-04 17:16:27] [INFO ] [Real]Absence check using 271 positive place invariants in 332 ms returned sat
[2020-06-04 17:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:16:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:16:32] [INFO ] [Real]Absence check using state equation in 4389 ms returned (error "Failed to check-sat")
[2020-06-04 17:16:32] [INFO ] [Real]Absence check using 271 positive place invariants in 306 ms returned sat
[2020-06-04 17:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:16:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:16:37] [INFO ] [Real]Absence check using state equation in 4433 ms returned (error "Failed to check-sat")
[2020-06-04 17:16:38] [INFO ] [Real]Absence check using 271 positive place invariants in 700 ms returned sat
[2020-06-04 17:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:16:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:16:42] [INFO ] [Real]Absence check using state equation in 3893 ms returned (error "Failed to check-sat")
Support contains 20 out of 1803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1803 transition count 1624
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1654 transition count 1624
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 298 place count 1654 transition count 1471
Deduced a syphon composed of 153 places in 3 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 604 place count 1501 transition count 1471
Symmetric choice reduction at 2 with 207 rule applications. Total rules 811 place count 1501 transition count 1471
Deduced a syphon composed of 207 places in 4 ms
Reduce places removed 207 places and 207 transitions.
Iterating global reduction 2 with 414 rules applied. Total rules applied 1225 place count 1294 transition count 1264
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 1225 place count 1294 transition count 1177
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 1399 place count 1207 transition count 1177
Performed 431 Post agglomeration using F-continuation condition.Transition count delta: 431
Deduced a syphon composed of 431 places in 2 ms
Reduce places removed 431 places and 0 transitions.
Iterating global reduction 2 with 862 rules applied. Total rules applied 2261 place count 776 transition count 746
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 2 with 203 rules applied. Total rules applied 2464 place count 776 transition count 746
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 2465 place count 776 transition count 746
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2466 place count 775 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2467 place count 774 transition count 745
Applied a total of 2467 rules in 834 ms. Remains 774 /1803 variables (removed 1029) and now considering 745/1773 (removed 1028) transitions.
Finished structural reductions, in 1 iterations. Remains : 774/1803 places, 745/1773 transitions.
Incomplete random walk after 1000000 steps, including 310 resets, run finished after 7689 ms. (steps per millisecond=130 ) properties seen :[0, 1, 0, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 4196 ms. (steps per millisecond=238 ) properties seen :[1, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 3727 ms. (steps per millisecond=268 ) properties seen :[0]
// Phase 1: matrix 745 rows 774 cols
[2020-06-04 17:16:58] [INFO ] Computed 270 place invariants in 58 ms
[2020-06-04 17:16:58] [INFO ] [Real]Absence check using 266 positive place invariants in 164 ms returned sat
[2020-06-04 17:16:58] [INFO ] [Real]Absence check using 266 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 17:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:17:00] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2020-06-04 17:17:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:17:00] [INFO ] [Nat]Absence check using 266 positive place invariants in 119 ms returned sat
[2020-06-04 17:17:00] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-04 17:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:17:02] [INFO ] [Nat]Absence check using state equation in 1425 ms returned sat
[2020-06-04 17:17:02] [INFO ] Deduced a trap composed of 5 places in 145 ms
[2020-06-04 17:17:02] [INFO ] Deduced a trap composed of 7 places in 153 ms
[2020-06-04 17:17:02] [INFO ] Deduced a trap composed of 15 places in 122 ms
[2020-06-04 17:17:02] [INFO ] Deduced a trap composed of 7 places in 116 ms
[2020-06-04 17:17:03] [INFO ] Deduced a trap composed of 8 places in 224 ms
[2020-06-04 17:17:04] [INFO ] Deduced a trap composed of 10 places in 1008 ms
[2020-06-04 17:17:04] [INFO ] Deduced a trap composed of 8 places in 133 ms
[2020-06-04 17:17:04] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-06-04 17:17:04] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-06-04 17:17:04] [INFO ] Deduced a trap composed of 14 places in 56 ms
[2020-06-04 17:17:04] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2020-06-04 17:17:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2744 ms
[2020-06-04 17:17:04] [INFO ] Computed and/alt/rep : 742/3976/742 causal constraints in 73 ms.
[2020-06-04 17:17:24] [INFO ] Added : 685 causal constraints over 137 iterations in 20131 ms.(timeout) Result :sat
[2020-06-04 17:17:25] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2020-06-04 17:17:26] [INFO ] Deduced a trap composed of 10 places in 924 ms
[2020-06-04 17:17:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1374 ms
Attempting to minimize the solution found.
Minimization took 96 ms.
Incomplete Parikh walk after 93200 steps, including 350 resets, run finished after 881 ms. (steps per millisecond=105 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 774 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 774/774 places, 745/745 transitions.
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 0 with 34 rules applied. Total rules applied 34 place count 757 transition count 728
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 757 transition count 728
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 756 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 755 transition count 726
Applied a total of 38 rules in 235 ms. Remains 755 /774 variables (removed 19) and now considering 726/745 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/774 places, 726/745 transitions.
Incomplete random walk after 1000000 steps, including 267 resets, run finished after 6184 ms. (steps per millisecond=161 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 3864 ms. (steps per millisecond=258 ) properties seen :[0]
Interrupted probabilistic random walk after 2326593 steps, run timeout after 30001 ms. (steps per millisecond=77 ) properties seen :[0]
Probabilistic random walk after 2326593 steps, saw 393659 distinct states, run finished after 30001 ms. (steps per millisecond=77 ) properties seen :[0]
// Phase 1: matrix 726 rows 755 cols
[2020-06-04 17:18:07] [INFO ] Computed 270 place invariants in 39 ms
[2020-06-04 17:18:08] [INFO ] [Real]Absence check using 268 positive place invariants in 232 ms returned sat
[2020-06-04 17:18:08] [INFO ] [Real]Absence check using 268 positive and 2 generalized place invariants in 5 ms returned sat
[2020-06-04 17:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:18:10] [INFO ] [Real]Absence check using state equation in 2567 ms returned sat
[2020-06-04 17:18:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:18:11] [INFO ] [Nat]Absence check using 268 positive place invariants in 170 ms returned sat
[2020-06-04 17:18:11] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 17:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:18:12] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2020-06-04 17:18:12] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-04 17:18:12] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 17 places in 138 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 5 places in 134 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 14 places in 140 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 16 places in 125 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2020-06-04 17:18:13] [INFO ] Deduced a trap composed of 11 places in 102 ms
[2020-06-04 17:18:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1628 ms
[2020-06-04 17:18:14] [INFO ] Computed and/alt/rep : 723/2372/723 causal constraints in 49 ms.
[2020-06-04 17:18:33] [INFO ] Added : 704 causal constraints over 141 iterations in 19322 ms. Result :unknown
Incomplete Parikh walk after 67500 steps, including 471 resets, run finished after 512 ms. (steps per millisecond=131 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 755 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 755/755 places, 726/726 transitions.
Applied a total of 0 rules in 22 ms. Remains 755 /755 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 726/726 transitions.
Starting structural reductions, iteration 0 : 755/755 places, 726/726 transitions.
Applied a total of 0 rules in 54 ms. Remains 755 /755 variables (removed 0) and now considering 726/726 (removed 0) transitions.
// Phase 1: matrix 726 rows 755 cols
[2020-06-04 17:18:33] [INFO ] Computed 270 place invariants in 74 ms
[2020-06-04 17:18:36] [INFO ] Implicit Places using invariants in 2387 ms returned []
// Phase 1: matrix 726 rows 755 cols
[2020-06-04 17:18:36] [INFO ] Computed 270 place invariants in 15 ms
[2020-06-04 17:18:45] [INFO ] Implicit Places using invariants and state equation in 8966 ms returned []
Implicit Place search using SMT with State Equation took 11366 ms to find 0 implicit places.
[2020-06-04 17:18:45] [INFO ] Redundant transitions in 115 ms returned []
// Phase 1: matrix 726 rows 755 cols
[2020-06-04 17:18:45] [INFO ] Computed 270 place invariants in 7 ms
[2020-06-04 17:18:46] [INFO ] Dead Transitions using invariants and state equation in 1540 ms returned []
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 726/726 transitions.
Incomplete random walk after 100000 steps, including 27 resets, run finished after 696 ms. (steps per millisecond=143 ) properties seen :[0]
// Phase 1: matrix 726 rows 755 cols
[2020-06-04 17:18:47] [INFO ] Computed 270 place invariants in 11 ms
[2020-06-04 17:18:47] [INFO ] [Real]Absence check using 268 positive place invariants in 148 ms returned sat
[2020-06-04 17:18:47] [INFO ] [Real]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 17:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:18:49] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2020-06-04 17:18:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:18:49] [INFO ] [Nat]Absence check using 268 positive place invariants in 380 ms returned sat
[2020-06-04 17:18:49] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 17:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:18:51] [INFO ] [Nat]Absence check using state equation in 1997 ms returned sat
[2020-06-04 17:18:51] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-06-04 17:18:52] [INFO ] Deduced a trap composed of 4 places in 471 ms
[2020-06-04 17:18:52] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-04 17:18:52] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-06-04 17:18:52] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-06-04 17:18:52] [INFO ] Deduced a trap composed of 14 places in 77 ms
[2020-06-04 17:18:52] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2020-06-04 17:18:53] [INFO ] Deduced a trap composed of 17 places in 120 ms
[2020-06-04 17:18:53] [INFO ] Deduced a trap composed of 11 places in 86 ms
[2020-06-04 17:18:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1569 ms
[2020-06-04 17:18:53] [INFO ] Computed and/alt/rep : 723/2372/723 causal constraints in 66 ms.
[2020-06-04 17:19:09] [INFO ] Added : 695 causal constraints over 139 iterations in 15929 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 755 transition count 726
Applied a total of 1 rules in 114 ms. Remains 755 /755 variables (removed 0) and now considering 726/726 (removed 0) transitions.
// Phase 1: matrix 726 rows 755 cols
[2020-06-04 17:19:09] [INFO ] Computed 270 place invariants in 13 ms
[2020-06-04 17:19:09] [INFO ] [Real]Absence check using 268 positive place invariants in 270 ms returned sat
[2020-06-04 17:19:09] [INFO ] [Real]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 17:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:19:14] [INFO ] [Real]Absence check using state equation in 4414 ms returned sat
[2020-06-04 17:19:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:19:15] [INFO ] [Nat]Absence check using 268 positive place invariants in 1426 ms returned sat
[2020-06-04 17:19:15] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-04 17:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:19:18] [INFO ] [Nat]Absence check using state equation in 2769 ms returned sat
[2020-06-04 17:19:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:19:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
[2020-06-04 17:19:18] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-04 17:19:19] [INFO ] Deduced a trap composed of 17 places in 152 ms
[2020-06-04 17:19:19] [INFO ] Deduced a trap composed of 17 places in 151 ms
[2020-06-04 17:19:19] [INFO ] Deduced a trap composed of 7 places in 153 ms
[2020-06-04 17:19:19] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2020-06-04 17:19:19] [INFO ] Deduced a trap composed of 11 places in 130 ms
[2020-06-04 17:19:19] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-04 17:19:20] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2020-06-04 17:19:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1369 ms
[2020-06-04 17:19:20] [INFO ] Computed and/alt/rep : 723/2376/723 causal constraints in 40 ms.
[2020-06-04 17:19:43] [INFO ] Added : 710 causal constraints over 142 iterations in 23095 ms.(timeout) Result :unknown
[2020-06-04 17:19:43] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-04 17:19:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 48 ms.
[2020-06-04 17:19:43] [INFO ] Flatten gal took : 179 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldIIPs-PT-030B @ 3570 seconds

FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ 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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:19:44 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 24188,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 7,
"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 <= p280)) AND ((p672 <= 0)) AND ((((1 <= p194)) AND ((p454 <= 0))) OR (((1 <= p240)) AND ((p559 <= 0)))))))",
"processed_size": 119,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3452,
"conflict_clusters": 98,
"places": 755,
"places_significant": 485,
"singleton_clusters": 0,
"transitions": 726
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"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: 1481/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24160
lola: finding significant places
lola: 755 places, 726 transitions, 485 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p672 <= 1)
lola: LP says that atomic proposition is always true: (p454 <= 1)
lola: LP says that atomic proposition is always true: (p559 <= 1)
lola: E (F ((((1 <= p280)) AND ((p672 <= 0)) AND ((((1 <= p194)) AND ((p454 <= 0))) OR (((1 <= p240)) AND ((p559 <= 0)))))))
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 <= p280)) AND ((p672 <= 0)) AND ((((1 <= p194)) AND ((p454 <= 0))) OR (((1 <= p240)) AND ((p559 <= 0)))))))
lola: processed formula length: 119
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: formula 0: (((1 <= p280)) AND ((p672 <= 0)) AND ((((1 <= p194)) AND ((p454 <= 0))) OR (((1 <= p240)) AND ((p559 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: local time limit reached - aborting
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3 markings, 2 edges
lola: memory consumption: 24188 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-159033477100166"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;