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-159033478100871.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 ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478100871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 4.1K May 14 02:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:09 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 370K 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 ShieldRVs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591331555962

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 04:32:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 04:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 04:32:41] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2020-06-05 04:32:41] [INFO ] Transformed 1203 places.
[2020-06-05 04:32:41] [INFO ] Transformed 1353 transitions.
[2020-06-05 04:32:41] [INFO ] Found NUPN structural information;
[2020-06-05 04:32:41] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 73 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 149 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 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, 0, 0, 0]
// Phase 1: matrix 1353 rows 1203 cols
[2020-06-05 04:32:42] [INFO ] Computed 121 place invariants in 84 ms
[2020-06-05 04:32:43] [INFO ] [Real]Absence check using 121 positive place invariants in 215 ms returned sat
[2020-06-05 04:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:32:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:32:47] [INFO ] [Real]Absence check using state equation in 4207 ms returned (error "Failed to check-sat")
[2020-06-05 04:32:48] [INFO ] [Real]Absence check using 121 positive place invariants in 368 ms returned sat
[2020-06-05 04:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:32:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:32:52] [INFO ] [Real]Absence check using state equation in 3935 ms returned (error "Failed to check-sat")
[2020-06-05 04:32:53] [INFO ] [Real]Absence check using 121 positive place invariants in 160 ms returned sat
[2020-06-05 04:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:32:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:32:57] [INFO ] [Real]Absence check using state equation in 4544 ms returned (error "Failed to check-sat")
[2020-06-05 04:32:58] [INFO ] [Real]Absence check using 121 positive place invariants in 175 ms returned sat
[2020-06-05 04:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:33:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:33:02] [INFO ] [Real]Absence check using state equation in 4602 ms returned (error "Failed to check-sat")
[2020-06-05 04:33:03] [INFO ] [Real]Absence check using 121 positive place invariants in 394 ms returned sat
[2020-06-05 04:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:33: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: Broken pipe (= s889 (- (+ t524 t527) t525))") while checking expression at index 4
[2020-06-05 04:33:08] [INFO ] [Real]Absence check using 121 positive place invariants in 177 ms returned sat
[2020-06-05 04:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:33:12] [INFO ] [Real]Absence check using state equation in 4556 ms returned (error "Failed to check-sat")
[2020-06-05 04:33:13] [INFO ] [Real]Absence check using 121 positive place invariants in 139 ms returned unsat
[2020-06-05 04:33:13] [INFO ] [Real]Absence check using 121 positive place invariants in 502 ms returned sat
[2020-06-05 04:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:33:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:33:18] [INFO ] [Real]Absence check using state equation in 4299 ms returned unknown
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 49 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 1203 transition count 1238
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 1088 transition count 1238
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 230 place count 1088 transition count 1088
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 530 place count 938 transition count 1088
Symmetric choice reduction at 2 with 197 rule applications. Total rules 727 place count 938 transition count 1088
Deduced a syphon composed of 197 places in 3 ms
Reduce places removed 197 places and 197 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 1121 place count 741 transition count 891
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 1121 place count 741 transition count 817
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 1269 place count 667 transition count 817
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 210
Deduced a syphon composed of 210 places in 2 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 2 with 420 rules applied. Total rules applied 1689 place count 457 transition count 607
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 2 with 59 rules applied. Total rules applied 1748 place count 457 transition count 607
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1749 place count 456 transition count 606
Applied a total of 1749 rules in 793 ms. Remains 456 /1203 variables (removed 747) and now considering 606/1353 (removed 747) transitions.
Finished structural reductions, in 1 iterations. Remains : 456/1203 places, 606/1353 transitions.
Incomplete random walk after 1000000 steps, including 2421 resets, run finished after 4259 ms. (steps per millisecond=234 ) properties seen :[1, 1, 1, 0, 1, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 274 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties seen :[1, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 258 resets, run finished after 2104 ms. (steps per millisecond=475 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 276 resets, run finished after 2204 ms. (steps per millisecond=453 ) properties seen :[0, 1]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 606 rows 456 cols
[2020-06-05 04:33:29] [INFO ] Computed 121 place invariants in 15 ms
[2020-06-05 04:33:29] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2020-06-05 04:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:33:31] [INFO ] [Real]Absence check using state equation in 1520 ms returned sat
[2020-06-05 04:33:32] [INFO ] Deduced a trap composed of 6 places in 1118 ms
[2020-06-05 04:33:32] [INFO ] Deduced a trap composed of 21 places in 221 ms
[2020-06-05 04:33:35] [INFO ] Deduced a trap composed of 24 places in 2545 ms
[2020-06-05 04:33:35] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-06-05 04:33:35] [INFO ] Deduced a trap composed of 7 places in 173 ms
[2020-06-05 04:33:36] [INFO ] Deduced a trap composed of 8 places in 311 ms
[2020-06-05 04:33:36] [INFO ] Deduced a trap composed of 14 places in 174 ms
[2020-06-05 04:33:36] [INFO ] Deduced a trap composed of 7 places in 195 ms
[2020-06-05 04:33:36] [INFO ] Deduced a trap composed of 12 places in 308 ms
[2020-06-05 04:33:37] [INFO ] Deduced a trap composed of 11 places in 196 ms
[2020-06-05 04:33:37] [INFO ] Deduced a trap composed of 11 places in 190 ms
[2020-06-05 04:33:37] [INFO ] Deduced a trap composed of 16 places in 131 ms
[2020-06-05 04:33:37] [INFO ] Deduced a trap composed of 12 places in 109 ms
[2020-06-05 04:33:37] [INFO ] Deduced a trap composed of 13 places in 113 ms
[2020-06-05 04:33:37] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-06-05 04:33:38] [INFO ] Deduced a trap composed of 12 places in 957 ms
[2020-06-05 04:33:39] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-06-05 04:33:39] [INFO ] Deduced a trap composed of 16 places in 208 ms
[2020-06-05 04:33:39] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-06-05 04:33:39] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2020-06-05 04:33:40] [INFO ] Deduced a trap composed of 16 places in 600 ms
[2020-06-05 04:33:40] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 9097 ms
[2020-06-05 04:33:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:33:41] [INFO ] [Nat]Absence check using 121 positive place invariants in 570 ms returned sat
[2020-06-05 04:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:33:44] [INFO ] [Nat]Absence check using state equation in 3020 ms returned sat
[2020-06-05 04:33:44] [INFO ] Deduced a trap composed of 9 places in 642 ms
[2020-06-05 04:33:45] [INFO ] Deduced a trap composed of 8 places in 362 ms
[2020-06-05 04:33:45] [INFO ] Deduced a trap composed of 7 places in 542 ms
[2020-06-05 04:33:46] [INFO ] Deduced a trap composed of 9 places in 760 ms
[2020-06-05 04:33:46] [INFO ] Deduced a trap composed of 13 places in 199 ms
[2020-06-05 04:33:46] [INFO ] Deduced a trap composed of 9 places in 170 ms
[2020-06-05 04:33:47] [INFO ] Deduced a trap composed of 10 places in 382 ms
[2020-06-05 04:33:47] [INFO ] Deduced a trap composed of 9 places in 254 ms
[2020-06-05 04:33:47] [INFO ] Deduced a trap composed of 14 places in 116 ms
[2020-06-05 04:33:47] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-06-05 04:33:48] [INFO ] Deduced a trap composed of 15 places in 597 ms
[2020-06-05 04:33:49] [INFO ] Deduced a trap composed of 10 places in 846 ms
[2020-06-05 04:33:49] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2020-06-05 04:33:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5523 ms
[2020-06-05 04:33:49] [INFO ] Computed and/alt/rep : 592/3221/592 causal constraints in 129 ms.
[2020-06-05 04:34:10] [INFO ] Added : 585 causal constraints over 117 iterations in 20487 ms.(timeout) Result :sat
[2020-06-05 04:34:10] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2020-06-05 04:34:10] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-06-05 04:34:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
Attempting to minimize the solution found.
Minimization took 99 ms.
Incomplete Parikh walk after 47900 steps, including 409 resets, run finished after 334 ms. (steps per millisecond=143 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 456 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 456/456 places, 606/606 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 456 transition count 602
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 452 transition count 602
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 452 transition count 593
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 443 transition count 593
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 13 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 431 transition count 581
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 431 transition count 581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 430 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 429 transition count 579
Applied a total of 54 rules in 306 ms. Remains 429 /456 variables (removed 27) and now considering 579/606 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/456 places, 579/606 transitions.
Incomplete random walk after 1000000 steps, including 2748 resets, run finished after 3984 ms. (steps per millisecond=251 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 317 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties seen :[0]
Interrupted probabilistic random walk after 6168075 steps, run timeout after 30001 ms. (steps per millisecond=205 ) properties seen :[0]
Probabilistic random walk after 6168075 steps, saw 1033848 distinct states, run finished after 30013 ms. (steps per millisecond=205 ) properties seen :[0]
// Phase 1: matrix 579 rows 429 cols
[2020-06-05 04:34:47] [INFO ] Computed 121 place invariants in 4 ms
[2020-06-05 04:34:47] [INFO ] [Real]Absence check using 121 positive place invariants in 105 ms returned sat
[2020-06-05 04:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:34:48] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2020-06-05 04:34:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:34:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 82 ms returned sat
[2020-06-05 04:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:34:49] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2020-06-05 04:34:49] [INFO ] Deduced a trap composed of 7 places in 183 ms
[2020-06-05 04:34:49] [INFO ] Deduced a trap composed of 26 places in 193 ms
[2020-06-05 04:34:49] [INFO ] Deduced a trap composed of 19 places in 113 ms
[2020-06-05 04:34:49] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2020-06-05 04:34:49] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 24 places in 124 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2020-06-05 04:34:50] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-05 04:34:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1568 ms
[2020-06-05 04:34:50] [INFO ] Computed and/alt/rep : 575/3144/575 causal constraints in 90 ms.
[2020-06-05 04:35:07] [INFO ] Added : 570 causal constraints over 114 iterations in 16783 ms. Result :unknown
Incomplete Parikh walk after 59700 steps, including 999 resets, run finished after 263 ms. (steps per millisecond=226 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 579/579 transitions.
Applied a total of 0 rules in 26 ms. Remains 429 /429 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 579/579 transitions.
Starting structural reductions, iteration 0 : 429/429 places, 579/579 transitions.
Applied a total of 0 rules in 20 ms. Remains 429 /429 variables (removed 0) and now considering 579/579 (removed 0) transitions.
// Phase 1: matrix 579 rows 429 cols
[2020-06-05 04:35:07] [INFO ] Computed 121 place invariants in 3 ms
[2020-06-05 04:35:08] [INFO ] Implicit Places using invariants in 913 ms returned []
// Phase 1: matrix 579 rows 429 cols
[2020-06-05 04:35:08] [INFO ] Computed 121 place invariants in 4 ms
[2020-06-05 04:35:11] [INFO ] Implicit Places using invariants and state equation in 2940 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
[2020-06-05 04:35:12] [INFO ] Redundant transitions in 627 ms returned []
// Phase 1: matrix 579 rows 429 cols
[2020-06-05 04:35:12] [INFO ] Computed 121 place invariants in 2 ms
[2020-06-05 04:35:13] [INFO ] Dead Transitions using invariants and state equation in 1347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 579/579 transitions.
Incomplete random walk after 100000 steps, including 274 resets, run finished after 332 ms. (steps per millisecond=301 ) properties seen :[0]
// Phase 1: matrix 579 rows 429 cols
[2020-06-05 04:35:14] [INFO ] Computed 121 place invariants in 12 ms
[2020-06-05 04:35:14] [INFO ] [Real]Absence check using 121 positive place invariants in 208 ms returned sat
[2020-06-05 04:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:35:15] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2020-06-05 04:35:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:35:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 778 ms returned sat
[2020-06-05 04:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:35:17] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-06-05 04:35:17] [INFO ] Deduced a trap composed of 7 places in 163 ms
[2020-06-05 04:35:17] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2020-06-05 04:35:17] [INFO ] Deduced a trap composed of 19 places in 141 ms
[2020-06-05 04:35:17] [INFO ] Deduced a trap composed of 15 places in 115 ms
[2020-06-05 04:35:18] [INFO ] Deduced a trap composed of 23 places in 314 ms
[2020-06-05 04:35:18] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2020-06-05 04:35:18] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-05 04:35:18] [INFO ] Deduced a trap composed of 24 places in 53 ms
[2020-06-05 04:35:18] [INFO ] Deduced a trap composed of 24 places in 51 ms
[2020-06-05 04:35:18] [INFO ] Deduced a trap composed of 24 places in 112 ms
[2020-06-05 04:35:19] [INFO ] Deduced a trap composed of 21 places in 931 ms
[2020-06-05 04:35:19] [INFO ] Deduced a trap composed of 24 places in 110 ms
[2020-06-05 04:35:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2569 ms
[2020-06-05 04:35:20] [INFO ] Computed and/alt/rep : 575/3144/575 causal constraints in 30 ms.
[2020-06-05 04:35:35] [INFO ] Added : 570 causal constraints over 114 iterations in 15830 ms. Result :unknown
Applied a total of 0 rules in 60 ms. Remains 429 /429 variables (removed 0) and now considering 579/579 (removed 0) transitions.
// Phase 1: matrix 579 rows 429 cols
[2020-06-05 04:35:35] [INFO ] Computed 121 place invariants in 2 ms
[2020-06-05 04:35:36] [INFO ] [Real]Absence check using 121 positive place invariants in 349 ms returned sat
[2020-06-05 04:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:35:38] [INFO ] [Real]Absence check using state equation in 1694 ms returned sat
[2020-06-05 04:35:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:35:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 118 ms returned sat
[2020-06-05 04:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:35:39] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2020-06-05 04:35:39] [INFO ] Deduced a trap composed of 7 places in 147 ms
[2020-06-05 04:35:39] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2020-06-05 04:35:39] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2020-06-05 04:35:41] [INFO ] Deduced a trap composed of 15 places in 1373 ms
[2020-06-05 04:35:41] [INFO ] Deduced a trap composed of 23 places in 125 ms
[2020-06-05 04:35:41] [INFO ] Deduced a trap composed of 17 places in 283 ms
[2020-06-05 04:35:41] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-06-05 04:35:42] [INFO ] Deduced a trap composed of 24 places in 372 ms
[2020-06-05 04:35:42] [INFO ] Deduced a trap composed of 24 places in 107 ms
[2020-06-05 04:35:42] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2020-06-05 04:35:42] [INFO ] Deduced a trap composed of 21 places in 117 ms
[2020-06-05 04:35:43] [INFO ] Deduced a trap composed of 24 places in 739 ms
[2020-06-05 04:35:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3935 ms
[2020-06-05 04:35:43] [INFO ] Computed and/alt/rep : 575/3144/575 causal constraints in 34 ms.
[2020-06-05 04:36:03] [INFO ] Added : 570 causal constraints over 114 iterations in 20149 ms. Result :unknown
[2020-06-05 04:36:03] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2020-06-05 04:36:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
[2020-06-05 04:36:03] [INFO ] Flatten gal took : 254 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-030B @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-030B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 04:36:04 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 22924,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((p18 <= 0) OR (p270 <= 0) OR ((1 <= p170)) OR (((p210 <= 0)) AND ((p303 <= 0))) OR ((1 <= p226) AND (1 <= p423)) OR ((1 <= p298) AND (1 <= p59)))))",
"processed_size": 159,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 2781,
"conflict_clusters": 38,
"places": 429,
"places_significant": 308,
"singleton_clusters": 0,
"transitions": 579
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 48,
"problems": 8
},
"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: 1008/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 13728
lola: finding significant places
lola: 429 places, 579 transitions, 308 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: A (G (((p18 <= 0) OR (p270 <= 0) OR ((1 <= p170)) OR (((p210 <= 0)) AND ((p303 <= 0))) OR ((1 <= p226) AND (1 <= p423)) OR ((1 <= p298) AND (1 <= p59)))))
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 (((p18 <= 0) OR (p270 <= 0) OR ((1 <= p170)) OR (((p210 <= 0)) AND ((p303 <= 0))) OR ((1 <= p226) AND (1 <= p423)) OR ((1 <= p298) AND (1 <= p59)))))
lola: processed formula length: 159
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: local time limit reached - aborting
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p18) AND (1 <= p270) AND ((p170 <= 0)) AND (((1 <= p210)) OR ((1 <= p303))) AND ((p226 <= 0) OR (p423 <= 0)) AND ((p298 <= 0) OR (p59 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: memory consumption: 22924 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478100871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;