Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390400734.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ResAllocation-PT-R050C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390400734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.1K May 14 00:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 00:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 17:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 13 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 212K May 12 20:53 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 ResAllocation-PT-R050C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591239502674

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:58:25] [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 02:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:58:25] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2020-06-04 02:58:25] [INFO ] Transformed 200 places.
[2020-06-04 02:58:25] [INFO ] Transformed 102 transitions.
[2020-06-04 02:58:25] [INFO ] Parsed PT model containing 200 places and 102 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 125 ms. (steps per millisecond=80 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 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, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 102 rows 200 cols
[2020-06-04 02:58:25] [INFO ] Computed 100 place invariants in 8 ms
[2020-06-04 02:58:26] [INFO ] [Real]Absence check using 100 positive place invariants in 128 ms returned sat
[2020-06-04 02:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:58:26] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-06-04 02:58:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:58:26] [INFO ] [Nat]Absence check using 100 positive place invariants in 43 ms returned sat
[2020-06-04 02:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:58:27] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2020-06-04 02:58:27] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-04 02:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2020-06-04 02:58:27] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 8 ms.
[2020-06-04 02:58:27] [INFO ] Added : 79 causal constraints over 16 iterations in 454 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-04 02:58:27] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned unsat
[2020-06-04 02:58:28] [INFO ] [Real]Absence check using 100 positive place invariants in 88 ms returned unsat
[2020-06-04 02:58:28] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned unsat
[2020-06-04 02:58:28] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned unsat
[2020-06-04 02:58:28] [INFO ] [Real]Absence check using 100 positive place invariants in 47 ms returned unsat
[2020-06-04 02:58:28] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned unsat
[2020-06-04 02:58:28] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned unsat
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 61800 steps, including 146 resets, run finished after 244 ms. (steps per millisecond=253 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 197 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 197 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 195 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 193 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 193 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 191 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 189 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 189 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 187 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 185 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 185 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 183 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 181 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 181 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 32 place count 179 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 177 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 177 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 175 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 41 place count 173 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 173 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 44 place count 171 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 47 place count 169 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 48 place count 169 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 50 place count 167 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 53 place count 165 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 54 place count 165 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 56 place count 163 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 59 place count 161 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 60 place count 161 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 62 place count 159 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 63 place count 159 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 64 place count 158 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 65 place count 158 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 68 place count 155 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 70 place count 154 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 71 place count 154 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 74 place count 151 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 76 place count 150 transition count 76
Applied a total of 76 rules in 248 ms. Remains 150 /200 variables (removed 50) and now considering 76/102 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/200 places, 76/102 transitions.
Incomplete random walk after 1000000 steps, including 2694 resets, run finished after 1972 ms. (steps per millisecond=507 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 436 resets, run finished after 1239 ms. (steps per millisecond=807 ) properties seen :[0]
Interrupted probabilistic random walk after 23289917 steps, run timeout after 30001 ms. (steps per millisecond=776 ) properties seen :[0]
Probabilistic random walk after 23289917 steps, saw 3830719 distinct states, run finished after 30001 ms. (steps per millisecond=776 ) properties seen :[0]
// Phase 1: matrix 76 rows 150 cols
[2020-06-04 02:59:02] [INFO ] Computed 76 place invariants in 2 ms
[2020-06-04 02:59:02] [INFO ] [Real]Absence check using 76 positive place invariants in 126 ms returned sat
[2020-06-04 02:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:02] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-06-04 02:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:02] [INFO ] [Nat]Absence check using 76 positive place invariants in 29 ms returned sat
[2020-06-04 02:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:02] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2020-06-04 02:59:02] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-04 02:59:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-06-04 02:59:02] [INFO ] Computed and/alt/rep : 74/74/74 causal constraints in 17 ms.
[2020-06-04 02:59:02] [INFO ] Added : 58 causal constraints over 12 iterations in 143 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 41300 steps, including 158 resets, run finished after 86 ms. (steps per millisecond=480 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 76/76 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 150 cols
[2020-06-04 02:59:02] [INFO ] Computed 76 place invariants in 2 ms
[2020-06-04 02:59:03] [INFO ] Implicit Places using invariants in 277 ms returned [77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 290 ms to find 37 implicit places.
[2020-06-04 02:59:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:03] [INFO ] Computed 39 place invariants in 1 ms
[2020-06-04 02:59:03] [INFO ] Dead Transitions using invariants and state equation in 709 ms returned []
Starting structural reductions, iteration 1 : 113/150 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2020-06-04 02:59:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:03] [INFO ] Computed 39 place invariants in 1 ms
[2020-06-04 02:59:04] [INFO ] Dead Transitions using invariants and state equation in 586 ms returned []
Finished structural reductions, in 2 iterations. Remains : 113/150 places, 76/76 transitions.
Incomplete random walk after 1000000 steps, including 2693 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 437 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties seen :[0]
Interrupted probabilistic random walk after 25624391 steps, run timeout after 30001 ms. (steps per millisecond=854 ) properties seen :[0]
Probabilistic random walk after 25624391 steps, saw 4199151 distinct states, run finished after 30002 ms. (steps per millisecond=854 ) properties seen :[0]
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:36] [INFO ] Computed 39 place invariants in 1 ms
[2020-06-04 02:59:36] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2020-06-04 02:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:36] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-06-04 02:59:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 137 ms returned sat
[2020-06-04 02:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:37] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-06-04 02:59:37] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-04 02:59:37] [INFO ] Deduced a trap composed of 3 places in 13 ms
[2020-06-04 02:59:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2020-06-04 02:59:37] [INFO ] Computed and/alt/rep : 74/74/74 causal constraints in 13 ms.
[2020-06-04 02:59:37] [INFO ] Added : 58 causal constraints over 12 iterations in 140 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 42700 steps, including 161 resets, run finished after 112 ms. (steps per millisecond=381 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 76/76 transitions.
Starting structural reductions, iteration 0 : 113/113 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:37] [INFO ] Computed 39 place invariants in 1 ms
[2020-06-04 02:59:37] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:37] [INFO ] Computed 39 place invariants in 15 ms
[2020-06-04 02:59:38] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2020-06-04 02:59:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:38] [INFO ] Computed 39 place invariants in 3 ms
[2020-06-04 02:59:38] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 76/76 transitions.
Incomplete random walk after 100000 steps, including 269 resets, run finished after 189 ms. (steps per millisecond=529 ) properties seen :[0]
// Phase 1: matrix 76 rows 113 cols
[2020-06-04 02:59:38] [INFO ] Computed 39 place invariants in 1 ms
[2020-06-04 02:59:38] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2020-06-04 02:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:38] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-04 02:59:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2020-06-04 02:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:38] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-06-04 02:59:38] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-04 02:59:38] [INFO ] Deduced a trap composed of 3 places in 13 ms
[2020-06-04 02:59:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2020-06-04 02:59:38] [INFO ] Computed and/alt/rep : 74/74/74 causal constraints in 9 ms.
[2020-06-04 02:59:38] [INFO ] Added : 58 causal constraints over 12 iterations in 121 ms. Result :sat
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 111 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 111 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 110 transition count 74
Applied a total of 5 rules in 12 ms. Remains 110 /113 variables (removed 3) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 110 cols
[2020-06-04 02:59:38] [INFO ] Computed 38 place invariants in 0 ms
[2020-06-04 02:59:38] [INFO ] [Real]Absence check using 38 positive place invariants in 24 ms returned sat
[2020-06-04 02:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:39] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-04 02:59:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:39] [INFO ] [Nat]Absence check using 38 positive place invariants in 16 ms returned sat
[2020-06-04 02:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-04 02:59:39] [INFO ] Computed and/alt/rep : 72/72/72 causal constraints in 3 ms.
[2020-06-04 02:59:39] [INFO ] Added : 57 causal constraints over 12 iterations in 91 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-04 02:59:39] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2020-06-04 02:59:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
[2020-06-04 02:59:39] [INFO ] Flatten gal took : 74 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ResAllocation-PT-R050C002 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ ResAllocation-PT-R050C002

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:59:39 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18948,
"runtime": 3.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": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p43 <= p75) OR ((1 <= p112) AND ((p43 <= p63) OR (p80 <= p67))))))",
"processed_size": 76,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 302,
"conflict_clusters": 38,
"places": 113,
"places_significant": 74,
"singleton_clusters": 0,
"transitions": 76
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"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: 189/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 113
lola: finding significant places
lola: 113 places, 76 transitions, 74 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: A (G (((p43 <= p75) OR ((1 <= p112) AND ((p43 <= p63) OR (p80 <= p67))))))
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 (((p43 <= p75) OR ((1 <= p112) AND ((p43 <= p63) OR (p80 <= p67))))))
lola: processed formula length: 76
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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p75 + 1 <= p43) AND ((p112 <= 0) OR ((p63 + 1 <= p43) AND (p67 + 1 <= p80))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: local time limit reached - aborting
lola: memory consumption: 18948 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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r194-csrt-159033390400734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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