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-159033477600518.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 ShieldPPPs-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-159033477600518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 3.2K May 14 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 528K 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 ShieldPPPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591311960017

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 23:06:01] [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 23:06:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 23:06:01] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2020-06-04 23:06:01] [INFO ] Transformed 2043 places.
[2020-06-04 23:06:01] [INFO ] Transformed 1893 transitions.
[2020-06-04 23:06:01] [INFO ] Found NUPN structural information;
[2020-06-04 23:06:01] [INFO ] Parsed PT model containing 2043 places and 1893 transitions in 219 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1 resets, run finished after 135 ms. (steps per millisecond=74 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 0, 1]
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0]
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]
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]
// Phase 1: matrix 1893 rows 2043 cols
[2020-06-04 23:06:02] [INFO ] Computed 331 place invariants in 47 ms
[2020-06-04 23:06:02] [INFO ] [Real]Absence check using 331 positive place invariants in 322 ms returned sat
[2020-06-04 23:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:06:07] [INFO ] [Real]Absence check using state equation in 4385 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 23:06:08] [INFO ] [Real]Absence check using 331 positive place invariants in 470 ms returned sat
[2020-06-04 23:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:06:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 23:06:12] [INFO ] [Real]Absence check using state equation in 4157 ms returned (error "Failed to check-sat")
[2020-06-04 23:06:12] [INFO ] [Real]Absence check using 331 positive place invariants in 327 ms returned sat
[2020-06-04 23:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:06:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 23:06:17] [INFO ] [Real]Absence check using state equation in 4423 ms returned (error "Failed to check-sat")
Support contains 17 out of 2043 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 2043 transition count 1685
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1835 transition count 1685
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 416 place count 1835 transition count 1534
Deduced a syphon composed of 151 places in 6 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 718 place count 1684 transition count 1534
Symmetric choice reduction at 2 with 205 rule applications. Total rules 923 place count 1684 transition count 1534
Deduced a syphon composed of 205 places in 8 ms
Reduce places removed 205 places and 205 transitions.
Iterating global reduction 2 with 410 rules applied. Total rules applied 1333 place count 1479 transition count 1329
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 1333 place count 1479 transition count 1244
Deduced a syphon composed of 85 places in 6 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 1503 place count 1394 transition count 1244
Performed 443 Post agglomeration using F-continuation condition.Transition count delta: 443
Deduced a syphon composed of 443 places in 1 ms
Reduce places removed 443 places and 0 transitions.
Iterating global reduction 2 with 886 rules applied. Total rules applied 2389 place count 951 transition count 801
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 263 times.
Drop transitions removed 263 transitions
Iterating global reduction 2 with 263 rules applied. Total rules applied 2652 place count 951 transition count 801
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2654 place count 951 transition count 801
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2655 place count 950 transition count 800
Applied a total of 2655 rules in 868 ms. Remains 950 /2043 variables (removed 1093) and now considering 800/1893 (removed 1093) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/2043 places, 800/1893 transitions.
Incomplete random walk after 1000000 steps, including 147 resets, run finished after 7318 ms. (steps per millisecond=136 ) properties seen :[1, 0, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 13 resets, run finished after 3979 ms. (steps per millisecond=251 ) properties seen :[1, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 3775 ms. (steps per millisecond=264 ) properties seen :[0]
// Phase 1: matrix 800 rows 950 cols
[2020-06-04 23:06:33] [INFO ] Computed 331 place invariants in 108 ms
[2020-06-04 23:06:33] [INFO ] [Real]Absence check using 313 positive place invariants in 204 ms returned sat
[2020-06-04 23:06:33] [INFO ] [Real]Absence check using 313 positive and 18 generalized place invariants in 15 ms returned sat
[2020-06-04 23:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:06:35] [INFO ] [Real]Absence check using state equation in 2116 ms returned sat
[2020-06-04 23:06:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:06:36] [INFO ] [Nat]Absence check using 313 positive place invariants in 236 ms returned sat
[2020-06-04 23:06:36] [INFO ] [Nat]Absence check using 313 positive and 18 generalized place invariants in 28 ms returned sat
[2020-06-04 23:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:06:38] [INFO ] [Nat]Absence check using state equation in 1965 ms returned sat
[2020-06-04 23:06:38] [INFO ] Deduced a trap composed of 6 places in 311 ms
[2020-06-04 23:06:39] [INFO ] Deduced a trap composed of 4 places in 312 ms
[2020-06-04 23:06:39] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-06-04 23:06:39] [INFO ] Deduced a trap composed of 6 places in 296 ms
[2020-06-04 23:06:40] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-04 23:06:40] [INFO ] Deduced a trap composed of 6 places in 346 ms
[2020-06-04 23:06:40] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-06-04 23:06:41] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:06:41] [INFO ] Deduced a trap composed of 9 places in 274 ms
[2020-06-04 23:06:41] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-06-04 23:06:42] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-06-04 23:06:42] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-06-04 23:06:42] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-06-04 23:06:43] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-06-04 23:06:43] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-04 23:06:43] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-06-04 23:06:43] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2020-06-04 23:06:44] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2020-06-04 23:06:44] [INFO ] Deduced a trap composed of 11 places in 232 ms
[2020-06-04 23:06:44] [INFO ] Deduced a trap composed of 5 places in 168 ms
[2020-06-04 23:06:44] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-06-04 23:06:45] [INFO ] Deduced a trap composed of 4 places in 186 ms
[2020-06-04 23:06:45] [INFO ] Deduced a trap composed of 6 places in 197 ms
[2020-06-04 23:06:45] [INFO ] Deduced a trap composed of 5 places in 200 ms
[2020-06-04 23:06:45] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-06-04 23:06:46] [INFO ] Deduced a trap composed of 7 places in 234 ms
[2020-06-04 23:06:46] [INFO ] Deduced a trap composed of 5 places in 203 ms
[2020-06-04 23:06:46] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-06-04 23:06:46] [INFO ] Deduced a trap composed of 5 places in 193 ms
[2020-06-04 23:06:47] [INFO ] Deduced a trap composed of 3 places in 263 ms
[2020-06-04 23:06:47] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-06-04 23:06:47] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-06-04 23:06:47] [INFO ] Deduced a trap composed of 15 places in 201 ms
[2020-06-04 23:06:48] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2020-06-04 23:06:48] [INFO ] Deduced a trap composed of 5 places in 189 ms
[2020-06-04 23:06:48] [INFO ] Deduced a trap composed of 11 places in 164 ms
[2020-06-04 23:06:48] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2020-06-04 23:06:49] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-06-04 23:06:49] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2020-06-04 23:06:49] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2020-06-04 23:06:49] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2020-06-04 23:06:49] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2020-06-04 23:06:50] [INFO ] Deduced a trap composed of 9 places in 193 ms
[2020-06-04 23:06:50] [INFO ] Deduced a trap composed of 8 places in 193 ms
[2020-06-04 23:06:50] [INFO ] Deduced a trap composed of 5 places in 170 ms
[2020-06-04 23:06:50] [INFO ] Deduced a trap composed of 20 places in 175 ms
[2020-06-04 23:06:50] [INFO ] Deduced a trap composed of 10 places in 193 ms
[2020-06-04 23:06:51] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 12688 ms
[2020-06-04 23:06:51] [INFO ] Computed and/alt/rep : 792/2386/792 causal constraints in 63 ms.
[2020-06-04 23:07:11] [INFO ] Added : 754 causal constraints over 153 iterations in 20196 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 75 ms.
Incomplete Parikh walk after 36700 steps, including 704 resets, run finished after 288 ms. (steps per millisecond=127 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 950/950 places, 800/800 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 948 transition count 798
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 948 transition count 796
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 946 transition count 796
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 939 transition count 789
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 939 transition count 789
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 938 transition count 788
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 937 transition count 787
Applied a total of 25 rules in 215 ms. Remains 937 /950 variables (removed 13) and now considering 787/800 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 937/950 places, 787/800 transitions.
Incomplete random walk after 1000000 steps, including 156 resets, run finished after 7139 ms. (steps per millisecond=140 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 3571 ms. (steps per millisecond=280 ) properties seen :[0]
Interrupted probabilistic random walk after 2591112 steps, run timeout after 30001 ms. (steps per millisecond=86 ) properties seen :[0]
Probabilistic random walk after 2591112 steps, saw 238095 distinct states, run finished after 30001 ms. (steps per millisecond=86 ) properties seen :[0]
// Phase 1: matrix 787 rows 937 cols
[2020-06-04 23:07:52] [INFO ] Computed 331 place invariants in 33 ms
[2020-06-04 23:07:53] [INFO ] [Real]Absence check using 310 positive place invariants in 213 ms returned sat
[2020-06-04 23:07:53] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 23:07:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:07:54] [INFO ] [Real]Absence check using state equation in 1923 ms returned sat
[2020-06-04 23:07:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:07:55] [INFO ] [Nat]Absence check using 310 positive place invariants in 192 ms returned sat
[2020-06-04 23:07:55] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 23:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:07:56] [INFO ] [Nat]Absence check using state equation in 1611 ms returned sat
[2020-06-04 23:07:57] [INFO ] Deduced a trap composed of 5 places in 377 ms
[2020-06-04 23:07:57] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-06-04 23:07:58] [INFO ] Deduced a trap composed of 4 places in 263 ms
[2020-06-04 23:07:58] [INFO ] Deduced a trap composed of 4 places in 310 ms
[2020-06-04 23:07:58] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-06-04 23:07:58] [INFO ] Deduced a trap composed of 11 places in 266 ms
[2020-06-04 23:07:59] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-06-04 23:08:00] [INFO ] Deduced a trap composed of 6 places in 748 ms
[2020-06-04 23:08:00] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-06-04 23:08:00] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-06-04 23:08:00] [INFO ] Deduced a trap composed of 7 places in 269 ms
[2020-06-04 23:08:01] [INFO ] Deduced a trap composed of 4 places in 248 ms
[2020-06-04 23:08:01] [INFO ] Deduced a trap composed of 6 places in 226 ms
[2020-06-04 23:08:01] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-06-04 23:08:02] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:08:02] [INFO ] Deduced a trap composed of 9 places in 260 ms
[2020-06-04 23:08:02] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-06-04 23:08:02] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-04 23:08:03] [INFO ] Deduced a trap composed of 7 places in 210 ms
[2020-06-04 23:08:03] [INFO ] Deduced a trap composed of 11 places in 238 ms
[2020-06-04 23:08:03] [INFO ] Deduced a trap composed of 8 places in 229 ms
[2020-06-04 23:08:03] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-06-04 23:08:04] [INFO ] Deduced a trap composed of 8 places in 255 ms
[2020-06-04 23:08:04] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-06-04 23:08:04] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-06-04 23:08:04] [INFO ] Deduced a trap composed of 8 places in 250 ms
[2020-06-04 23:08:05] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-06-04 23:08:05] [INFO ] Deduced a trap composed of 11 places in 210 ms
[2020-06-04 23:08:05] [INFO ] Deduced a trap composed of 8 places in 198 ms
[2020-06-04 23:08:05] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-06-04 23:08:06] [INFO ] Deduced a trap composed of 6 places in 191 ms
[2020-06-04 23:08:06] [INFO ] Deduced a trap composed of 6 places in 185 ms
[2020-06-04 23:08:06] [INFO ] Deduced a trap composed of 9 places in 181 ms
[2020-06-04 23:08:06] [INFO ] Deduced a trap composed of 5 places in 194 ms
[2020-06-04 23:08:07] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-06-04 23:08:07] [INFO ] Deduced a trap composed of 8 places in 166 ms
[2020-06-04 23:08:07] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-06-04 23:08:07] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-06-04 23:08:07] [INFO ] Deduced a trap composed of 8 places in 153 ms
[2020-06-04 23:08:08] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-06-04 23:08:08] [INFO ] Deduced a trap composed of 6 places in 155 ms
[2020-06-04 23:08:08] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-06-04 23:08:08] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-04 23:08:08] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-06-04 23:08:08] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-06-04 23:08:09] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-06-04 23:08:09] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-04 23:08:09] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2020-06-04 23:08:09] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 12584 ms
[2020-06-04 23:08:09] [INFO ] Computed and/alt/rep : 783/2374/783 causal constraints in 61 ms.
[2020-06-04 23:08:30] [INFO ] Added : 751 causal constraints over 151 iterations in 20418 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 85 ms.
Incomplete Parikh walk after 56700 steps, including 809 resets, run finished after 448 ms. (steps per millisecond=126 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 937 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 937/937 places, 787/787 transitions.
Applied a total of 0 rules in 27 ms. Remains 937 /937 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 937/937 places, 787/787 transitions.
Starting structural reductions, iteration 0 : 937/937 places, 787/787 transitions.
Applied a total of 0 rules in 61 ms. Remains 937 /937 variables (removed 0) and now considering 787/787 (removed 0) transitions.
// Phase 1: matrix 787 rows 937 cols
[2020-06-04 23:08:30] [INFO ] Computed 331 place invariants in 37 ms
[2020-06-04 23:08:33] [INFO ] Implicit Places using invariants in 2518 ms returned []
// Phase 1: matrix 787 rows 937 cols
[2020-06-04 23:08:33] [INFO ] Computed 331 place invariants in 7 ms
[2020-06-04 23:08:41] [INFO ] Implicit Places using invariants and state equation in 8334 ms returned []
Implicit Place search using SMT with State Equation took 10854 ms to find 0 implicit places.
[2020-06-04 23:08:41] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 787 rows 937 cols
[2020-06-04 23:08:41] [INFO ] Computed 331 place invariants in 6 ms
[2020-06-04 23:08:43] [INFO ] Dead Transitions using invariants and state equation in 1801 ms returned []
Finished structural reductions, in 1 iterations. Remains : 937/937 places, 787/787 transitions.
Incomplete random walk after 100000 steps, including 16 resets, run finished after 640 ms. (steps per millisecond=156 ) properties seen :[0]
// Phase 1: matrix 787 rows 937 cols
[2020-06-04 23:08:44] [INFO ] Computed 331 place invariants in 5 ms
[2020-06-04 23:08:44] [INFO ] [Real]Absence check using 310 positive place invariants in 190 ms returned sat
[2020-06-04 23:08:44] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 23:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:08:46] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2020-06-04 23:08:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:08:46] [INFO ] [Nat]Absence check using 310 positive place invariants in 191 ms returned sat
[2020-06-04 23:08:46] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 23:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:08:48] [INFO ] [Nat]Absence check using state equation in 1667 ms returned sat
[2020-06-04 23:08:48] [INFO ] Deduced a trap composed of 5 places in 336 ms
[2020-06-04 23:08:48] [INFO ] Deduced a trap composed of 6 places in 324 ms
[2020-06-04 23:08:49] [INFO ] Deduced a trap composed of 4 places in 312 ms
[2020-06-04 23:08:49] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-06-04 23:08:49] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2020-06-04 23:08:50] [INFO ] Deduced a trap composed of 11 places in 288 ms
[2020-06-04 23:08:50] [INFO ] Deduced a trap composed of 6 places in 312 ms
[2020-06-04 23:08:50] [INFO ] Deduced a trap composed of 6 places in 285 ms
[2020-06-04 23:08:51] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2020-06-04 23:08:51] [INFO ] Deduced a trap composed of 5 places in 272 ms
[2020-06-04 23:08:51] [INFO ] Deduced a trap composed of 7 places in 288 ms
[2020-06-04 23:08:51] [INFO ] Deduced a trap composed of 4 places in 236 ms
[2020-06-04 23:08:52] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-06-04 23:08:52] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-06-04 23:08:52] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-06-04 23:08:53] [INFO ] Deduced a trap composed of 9 places in 243 ms
[2020-06-04 23:08:53] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-06-04 23:08:53] [INFO ] Deduced a trap composed of 4 places in 223 ms
[2020-06-04 23:08:53] [INFO ] Deduced a trap composed of 7 places in 237 ms
[2020-06-04 23:08:54] [INFO ] Deduced a trap composed of 11 places in 224 ms
[2020-06-04 23:08:54] [INFO ] Deduced a trap composed of 8 places in 243 ms
[2020-06-04 23:08:54] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-04 23:08:54] [INFO ] Deduced a trap composed of 8 places in 258 ms
[2020-06-04 23:08:55] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-06-04 23:08:55] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-06-04 23:08:55] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-06-04 23:08:56] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-06-04 23:08:56] [INFO ] Deduced a trap composed of 11 places in 203 ms
[2020-06-04 23:08:56] [INFO ] Deduced a trap composed of 8 places in 182 ms
[2020-06-04 23:08:56] [INFO ] Deduced a trap composed of 6 places in 215 ms
[2020-06-04 23:08:56] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2020-06-04 23:08:57] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-04 23:08:57] [INFO ] Deduced a trap composed of 9 places in 194 ms
[2020-06-04 23:08:57] [INFO ] Deduced a trap composed of 5 places in 176 ms
[2020-06-04 23:08:57] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-06-04 23:08:58] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2020-06-04 23:08:58] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-04 23:08:58] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2020-06-04 23:08:58] [INFO ] Deduced a trap composed of 8 places in 139 ms
[2020-06-04 23:08:58] [INFO ] Deduced a trap composed of 6 places in 116 ms
[2020-06-04 23:08:58] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-04 23:08:59] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2020-06-04 23:08:59] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-04 23:08:59] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-06-04 23:08:59] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2020-06-04 23:08:59] [INFO ] Deduced a trap composed of 9 places in 145 ms
[2020-06-04 23:09:00] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-06-04 23:09:00] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2020-06-04 23:09:00] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 12086 ms
[2020-06-04 23:09:00] [INFO ] Computed and/alt/rep : 783/2374/783 causal constraints in 77 ms.
[2020-06-04 23:09:06] [INFO ] Added : 345 causal constraints over 69 iterations in 5877 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 937 transition count 787
Applied a total of 2 rules in 74 ms. Remains 937 /937 variables (removed 0) and now considering 787/787 (removed 0) transitions.
// Phase 1: matrix 787 rows 937 cols
[2020-06-04 23:09:06] [INFO ] Computed 331 place invariants in 12 ms
[2020-06-04 23:09:06] [INFO ] [Real]Absence check using 311 positive place invariants in 215 ms returned sat
[2020-06-04 23:09:06] [INFO ] [Real]Absence check using 311 positive and 20 generalized place invariants in 16 ms returned sat
[2020-06-04 23:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:09:08] [INFO ] [Real]Absence check using state equation in 1706 ms returned sat
[2020-06-04 23:09:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:09:08] [INFO ] [Nat]Absence check using 311 positive place invariants in 195 ms returned sat
[2020-06-04 23:09:08] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 14 ms returned sat
[2020-06-04 23:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:09:10] [INFO ] [Nat]Absence check using state equation in 1664 ms returned sat
[2020-06-04 23:09:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-04 23:09:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-04 23:09:10] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-06-04 23:09:10] [INFO ] Deduced a trap composed of 5 places in 243 ms
[2020-06-04 23:09:11] [INFO ] Deduced a trap composed of 9 places in 253 ms
[2020-06-04 23:09:11] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-06-04 23:09:11] [INFO ] Deduced a trap composed of 4 places in 242 ms
[2020-06-04 23:09:12] [INFO ] Deduced a trap composed of 7 places in 247 ms
[2020-06-04 23:09:12] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-06-04 23:09:12] [INFO ] Deduced a trap composed of 9 places in 233 ms
[2020-06-04 23:09:12] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-04 23:09:13] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-06-04 23:09:13] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-06-04 23:09:13] [INFO ] Deduced a trap composed of 5 places in 278 ms
[2020-06-04 23:09:14] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-06-04 23:09:14] [INFO ] Deduced a trap composed of 5 places in 260 ms
[2020-06-04 23:09:14] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-06-04 23:09:14] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-06-04 23:09:15] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-06-04 23:09:15] [INFO ] Deduced a trap composed of 7 places in 203 ms
[2020-06-04 23:09:15] [INFO ] Deduced a trap composed of 7 places in 213 ms
[2020-06-04 23:09:15] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-04 23:09:16] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-06-04 23:09:16] [INFO ] Deduced a trap composed of 6 places in 208 ms
[2020-06-04 23:09:16] [INFO ] Deduced a trap composed of 6 places in 232 ms
[2020-06-04 23:09:16] [INFO ] Deduced a trap composed of 4 places in 194 ms
[2020-06-04 23:09:17] [INFO ] Deduced a trap composed of 11 places in 224 ms
[2020-06-04 23:09:17] [INFO ] Deduced a trap composed of 8 places in 177 ms
[2020-06-04 23:09:17] [INFO ] Deduced a trap composed of 7 places in 219 ms
[2020-06-04 23:09:17] [INFO ] Deduced a trap composed of 11 places in 214 ms
[2020-06-04 23:09:18] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-06-04 23:09:18] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-06-04 23:09:18] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-06-04 23:09:18] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-06-04 23:09:19] [INFO ] Deduced a trap composed of 9 places in 222 ms
[2020-06-04 23:09:19] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-06-04 23:09:19] [INFO ] Deduced a trap composed of 6 places in 171 ms
[2020-06-04 23:09:19] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2020-06-04 23:09:19] [INFO ] Deduced a trap composed of 4 places in 203 ms
[2020-06-04 23:09:20] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2020-06-04 23:09:20] [INFO ] Deduced a trap composed of 7 places in 207 ms
[2020-06-04 23:09:20] [INFO ] Deduced a trap composed of 5 places in 201 ms
[2020-06-04 23:09:20] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2020-06-04 23:09:21] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2020-06-04 23:09:21] [INFO ] Deduced a trap composed of 5 places in 205 ms
[2020-06-04 23:09:21] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2020-06-04 23:09:21] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-06-04 23:09:22] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-06-04 23:09:22] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-04 23:09:22] [INFO ] Deduced a trap composed of 8 places in 177 ms
[2020-06-04 23:09:22] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-06-04 23:09:22] [INFO ] Deduced a trap composed of 23 places in 146 ms
[2020-06-04 23:09:23] [INFO ] Deduced a trap composed of 17 places in 168 ms
[2020-06-04 23:09:23] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 12743 ms
[2020-06-04 23:09:23] [INFO ] Computed and/alt/rep : 783/2383/783 causal constraints in 53 ms.
[2020-06-04 23:09:44] [INFO ] Added : 746 causal constraints over 150 iterations in 21178 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-06-04 23:09:44] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-04 23:09:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
[2020-06-04 23:09:44] [INFO ] Flatten gal took : 139 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldPPPs-PT-030B @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ ShieldPPPs-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 23:09:45 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 24576,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((((p305 <= 0)) OR ((1 <= p853)) OR (p688 <= 0) OR (((1 <= p736)) AND ((p655 <= 0))))))",
"processed_size": 95,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 3507,
"conflict_clusters": 161,
"places": 937,
"places_significant": 606,
"singleton_clusters": 0,
"transitions": 787
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"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: 1724/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 29984
lola: finding significant places
lola: 937 places, 787 transitions, 606 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: (p853 <= 1)
lola: LP says that atomic proposition is always true: (p688 <= 1)
lola: LP says that atomic proposition is always true: (p655 <= 1)
lola: A (G ((((p305 <= 0)) OR ((1 <= p853)) OR (p688 <= 0) OR (((1 <= p736)) AND ((p655 <= 0))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p305 <= 0)) OR ((1 <= p853)) OR (p688 <= 0) OR (((1 <= p736)) AND ((p655 <= 0))))))
lola: processed formula length: 95
lola: 2 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p305)) AND ((p853 <= 0)) AND (1 <= p688) AND (((p736 <= 0)) OR ((1 <= p655))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: memory consumption: 24576 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="ShieldPPPs-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 ShieldPPPs-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-159033477600518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-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 ;