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-159033477800678.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 ShieldPPPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 3.4K May 14 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.4K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:52 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 376K 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591320811221

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:33:32] [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-05 01:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:33:32] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2020-06-05 01:33:32] [INFO ] Transformed 1563 places.
[2020-06-05 01:33:32] [INFO ] Transformed 1423 transitions.
[2020-06-05 01:33:32] [INFO ] Found NUPN structural information;
[2020-06-05 01:33:32] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1]
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[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, 0, 0, 0, 0]
// Phase 1: matrix 1423 rows 1563 cols
[2020-06-05 01:33:33] [INFO ] Computed 221 place invariants in 54 ms
[2020-06-05 01:33:33] [INFO ] [Real]Absence check using 221 positive place invariants in 229 ms returned sat
[2020-06-05 01:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:38] [INFO ] [Real]Absence check using state equation in 4098 ms returned sat
[2020-06-05 01:33:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:33:38] [INFO ] [Nat]Absence check using 221 positive place invariants in 208 ms returned sat
[2020-06-05 01:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:42] [INFO ] [Nat]Absence check using state equation in 3725 ms returned sat
[2020-06-05 01:33:43] [INFO ] Deduced a trap composed of 24 places in 709 ms
[2020-06-05 01:33:43] [INFO ] Deduced a trap composed of 18 places in 655 ms
[2020-06-05 01:33:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s1409 s1410 s1411 s1412 s1413 s1414 s1434 s1541 s1542 s1543 s1544 s1545 s1546 s1547 s1548 s1549) 0)") while checking expression at index 0
[2020-06-05 01:33:44] [INFO ] [Real]Absence check using 221 positive place invariants in 186 ms returned sat
[2020-06-05 01:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:48] [INFO ] [Real]Absence check using state equation in 4090 ms returned sat
[2020-06-05 01:33:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:33:48] [INFO ] [Nat]Absence check using 221 positive place invariants in 219 ms returned sat
[2020-06-05 01:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:52] [INFO ] [Nat]Absence check using state equation in 3998 ms returned sat
[2020-06-05 01:33:53] [INFO ] Deduced a trap composed of 31 places in 561 ms
[2020-06-05 01:33:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s1112 s1113 s1116 s1135 s1136 s1137 s1138 s1139 s1140 s1141 s1142 s1146 s1147 s1148 s1149 s1150 s1151 s1152 s1178 s1179 s1180 s1181 s1182 s1183 s1184 s1196) 0)") while checking expression at index 1
[2020-06-05 01:33:53] [INFO ] [Real]Absence check using 221 positive place invariants in 184 ms returned sat
[2020-06-05 01:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:57] [INFO ] [Real]Absence check using state equation in 4139 ms returned sat
[2020-06-05 01:33:58] [INFO ] Deduced a trap composed of 27 places in 526 ms
[2020-06-05 01:33:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s793 s794 s811 s812 s813 s816 s817 s859 s861 s862 s863 s864 s865 s866 s867 s868 s869) 0)") while checking expression at index 2
[2020-06-05 01:33:58] [INFO ] [Real]Absence check using 221 positive place invariants in 237 ms returned sat
[2020-06-05 01:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:02] [INFO ] [Real]Absence check using state equation in 3924 ms returned sat
[2020-06-05 01:34:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 314 ms returned sat
[2020-06-05 01:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:07] [INFO ] [Nat]Absence check using state equation in 3826 ms returned sat
[2020-06-05 01:34:07] [INFO ] Deduced a trap composed of 21 places in 612 ms
[2020-06-05 01:34:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s1332 s1333 s1334 s1335 s1336 s1337 s1357 s1359 s1360 s1399 s1400 s1401 s1402 s1403 s1404 s1405 s1406 s1407) 0)") while checking expression at index 3
[2020-06-05 01:34:08] [INFO ] [Real]Absence check using 221 positive place invariants in 249 ms returned sat
[2020-06-05 01:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:12] [INFO ] [Real]Absence check using state equation in 4093 ms returned sat
[2020-06-05 01:34:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:13] [INFO ] [Nat]Absence check using 221 positive place invariants in 421 ms returned sat
[2020-06-05 01:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:17] [INFO ] [Nat]Absence check using state equation in 4255 ms returned sat
[2020-06-05 01:34:18] [INFO ] Deduced a trap composed of 27 places in 652 ms
[2020-06-05 01:34:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s716 s717 s718 s719 s720 s721 s741 s848 s849 s850 s851 s852 s853 s854 s855 s856) 0)") while checking expression at index 4
Support contains 20 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Performed 371 Post agglomeration using F-continuation condition.Transition count delta: 371
Iterating post reduction 0 with 371 rules applied. Total rules applied 371 place count 1563 transition count 1052
Reduce places removed 371 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 373 rules applied. Total rules applied 744 place count 1192 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 745 place count 1191 transition count 1050
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 745 place count 1191 transition count 964
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 917 place count 1105 transition count 964
Symmetric choice reduction at 3 with 134 rule applications. Total rules 1051 place count 1105 transition count 964
Deduced a syphon composed of 134 places in 10 ms
Reduce places removed 134 places and 134 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 1319 place count 971 transition count 830
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 1319 place count 971 transition count 773
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1433 place count 914 transition count 773
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 328
Deduced a syphon composed of 328 places in 1 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 3 with 656 rules applied. Total rules applied 2089 place count 586 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 2207 place count 527 transition count 445
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 2262 place count 527 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2263 place count 526 transition count 444
Applied a total of 2263 rules in 549 ms. Remains 526 /1563 variables (removed 1037) and now considering 444/1423 (removed 979) transitions.
Finished structural reductions, in 1 iterations. Remains : 526/1563 places, 444/1423 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 4006 ms. (steps per millisecond=249 ) properties seen :[0, 1, 1, 1, 1]
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2291 ms. (steps per millisecond=436 ) properties seen :[0]
// Phase 1: matrix 444 rows 526 cols
[2020-06-05 01:34:25] [INFO ] Computed 221 place invariants in 2 ms
[2020-06-05 01:34:25] [INFO ] [Real]Absence check using 221 positive place invariants in 110 ms returned sat
[2020-06-05 01:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:25] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2020-06-05 01:34:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:26] [INFO ] [Nat]Absence check using 221 positive place invariants in 98 ms returned sat
[2020-06-05 01:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:26] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2020-06-05 01:34:26] [INFO ] State equation strengthened by 117 read => feed constraints.
[2020-06-05 01:34:26] [INFO ] [Nat]Added 117 Read/Feed constraints in 33 ms returned sat
[2020-06-05 01:34:26] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-06-05 01:34:26] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-06-05 01:34:26] [INFO ] Deduced a trap composed of 7 places in 21 ms
[2020-06-05 01:34:26] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-06-05 01:34:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 174 ms
[2020-06-05 01:34:26] [INFO ] Computed and/alt/rep : 441/1716/441 causal constraints in 24 ms.
[2020-06-05 01:34:37] [INFO ] Added : 430 causal constraints over 92 iterations in 10872 ms. Result :unknown
Incomplete Parikh walk after 72200 steps, including 563 resets, run finished after 389 ms. (steps per millisecond=185 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 526 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 526/526 places, 444/444 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 525 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 525 transition count 442
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 524 transition count 442
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 512 transition count 430
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 512 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 511 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 510 transition count 428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 509 transition count 427
Applied a total of 34 rules in 164 ms. Remains 509 /526 variables (removed 17) and now considering 427/444 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 509/526 places, 427/444 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3463 ms. (steps per millisecond=288 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3113 ms. (steps per millisecond=321 ) properties seen :[0]
Interrupted probabilistic random walk after 4933229 steps, run timeout after 30001 ms. (steps per millisecond=164 ) properties seen :[0]
Probabilistic random walk after 4933229 steps, saw 695079 distinct states, run finished after 30001 ms. (steps per millisecond=164 ) properties seen :[0]
// Phase 1: matrix 427 rows 509 cols
[2020-06-05 01:35:14] [INFO ] Computed 221 place invariants in 2 ms
[2020-06-05 01:35:15] [INFO ] [Real]Absence check using 221 positive place invariants in 110 ms returned sat
[2020-06-05 01:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:15] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-06-05 01:35:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:16] [INFO ] [Nat]Absence check using 221 positive place invariants in 104 ms returned sat
[2020-06-05 01:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:16] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2020-06-05 01:35:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-06-05 01:35:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2020-06-05 01:35:16] [INFO ] Deduced a trap composed of 3 places in 89 ms
[2020-06-05 01:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-06-05 01:35:16] [INFO ] Computed and/alt/rep : 419/1042/419 causal constraints in 29 ms.
[2020-06-05 01:35:25] [INFO ] Added : 395 causal constraints over 80 iterations in 8511 ms. Result :unknown
Incomplete Parikh walk after 62700 steps, including 1000 resets, run finished after 360 ms. (steps per millisecond=174 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 509 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 509/509 places, 427/427 transitions.
Applied a total of 0 rules in 32 ms. Remains 509 /509 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 509/509 places, 427/427 transitions.
Starting structural reductions, iteration 0 : 509/509 places, 427/427 transitions.
Applied a total of 0 rules in 20 ms. Remains 509 /509 variables (removed 0) and now considering 427/427 (removed 0) transitions.
// Phase 1: matrix 427 rows 509 cols
[2020-06-05 01:35:25] [INFO ] Computed 221 place invariants in 3 ms
[2020-06-05 01:35:26] [INFO ] Implicit Places using invariants in 957 ms returned []
// Phase 1: matrix 427 rows 509 cols
[2020-06-05 01:35:26] [INFO ] Computed 221 place invariants in 3 ms
[2020-06-05 01:35:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-06-05 01:35:29] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2020-06-05 01:35:29] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 427 rows 509 cols
[2020-06-05 01:35:29] [INFO ] Computed 221 place invariants in 2 ms
[2020-06-05 01:35:30] [INFO ] Dead Transitions using invariants and state equation in 756 ms returned []
Finished structural reductions, in 1 iterations. Remains : 509/509 places, 427/427 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 452 ms. (steps per millisecond=221 ) properties seen :[0]
// Phase 1: matrix 427 rows 509 cols
[2020-06-05 01:35:30] [INFO ] Computed 221 place invariants in 2 ms
[2020-06-05 01:35:30] [INFO ] [Real]Absence check using 221 positive place invariants in 106 ms returned sat
[2020-06-05 01:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:31] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2020-06-05 01:35:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:31] [INFO ] [Nat]Absence check using 221 positive place invariants in 84 ms returned sat
[2020-06-05 01:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:31] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-06-05 01:35:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-06-05 01:35:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2020-06-05 01:35:32] [INFO ] Deduced a trap composed of 3 places in 84 ms
[2020-06-05 01:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2020-06-05 01:35:32] [INFO ] Computed and/alt/rep : 419/1042/419 causal constraints in 27 ms.
[2020-06-05 01:35:40] [INFO ] Added : 395 causal constraints over 80 iterations in 8130 ms. Result :unknown
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1305 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 508 transition count 425
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 506 transition count 425
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 123 place count 506 transition count 425
Partial Post-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 141 place count 506 transition count 425
Applied a total of 141 rules in 73 ms. Remains 506 /509 variables (removed 3) and now considering 425/427 (removed 2) transitions.
// Phase 1: matrix 425 rows 506 cols
[2020-06-05 01:35:40] [INFO ] Computed 220 place invariants in 2 ms
[2020-06-05 01:35:40] [INFO ] [Real]Absence check using 220 positive place invariants in 106 ms returned sat
[2020-06-05 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:41] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2020-06-05 01:35:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:41] [INFO ] [Nat]Absence check using 220 positive place invariants in 102 ms returned sat
[2020-06-05 01:35:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:41] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2020-06-05 01:35:41] [INFO ] State equation strengthened by 115 read => feed constraints.
[2020-06-05 01:35:41] [INFO ] [Nat]Added 115 Read/Feed constraints in 20 ms returned sat
[2020-06-05 01:35:41] [INFO ] Computed and/alt/rep : 419/1456/419 causal constraints in 29 ms.
[2020-06-05 01:35:50] [INFO ] Added : 400 causal constraints over 80 iterations in 8789 ms. Result :unknown
[2020-06-05 01:35:50] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2020-06-05 01:35:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
[2020-06-05 01:35:50] [INFO ] Flatten gal took : 97 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldPPPt-PT-020B @ 3570 seconds

FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ ShieldPPPt-PT-020B

{
"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": "Fri Jun 5 01:35:51 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20916,
"runtime": 3.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": 1,
"adisj": 4,
"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 <= p406)) AND ((p226 <= 0)) AND ((1 <= p502)) AND ((p204 <= 0)) AND (1 <= p90) AND (1 <= p265))))",
"processed_size": 108,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1873,
"conflict_clusters": 171,
"places": 509,
"places_significant": 288,
"singleton_clusters": 0,
"transitions": 427
},
"result":
{
"edges": 9,
"markings": 10,
"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": 6,
"problems": 6
},
"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: 936/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16288
lola: finding significant places
lola: 509 places, 427 transitions, 288 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: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: E (F ((((1 <= p406)) AND ((p226 <= 0)) AND ((1 <= p502)) AND ((p204 <= 0)) AND (1 <= p90) AND (1 <= p265))))
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 <= p406)) AND ((p226 <= 0)) AND ((1 <= p502)) AND ((p204 <= 0)) AND (1 <= p90) AND (1 <= p265))))
lola: processed formula length: 108
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: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation task get result unparse finished++ id 0
lola: 10 markings, 9 edges
lola: formula 0: (((1 <= p406)) AND ((p226 <= 0)) AND ((1 <= p502)) AND ((p204 <= 0)) AND (1 <= p90) AND (1 <= p265))
lola: local time limit reached - aborting
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: memory consumption: 20916 KB
lola: time consumption: 3 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="ShieldPPPt-PT-020B"
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 ShieldPPPt-PT-020B, 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-159033477800678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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