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.r180-ebro-158987899900262.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 DES-PT-20a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 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 DES-PT-20a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591183978207

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:33:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 11:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:33:02] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-06-03 11:33:02] [INFO ] Transformed 195 places.
[2020-06-03 11:33:02] [INFO ] Transformed 152 transitions.
[2020-06-03 11:33:02] [INFO ] Found NUPN structural information;
[2020-06-03 11:33:02] [INFO ] Parsed PT model containing 195 places and 152 transitions in 201 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 229 resets, run finished after 119 ms. (steps per millisecond=84 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 1]
FORMULA DES-PT-20a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 138 rows 195 cols
[2020-06-03 11:33:02] [INFO ] Computed 59 place invariants in 28 ms
[2020-06-03 11:33:02] [INFO ] [Real]Absence check using 34 positive place invariants in 51 ms returned sat
[2020-06-03 11:33:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 64 ms returned sat
[2020-06-03 11:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:03] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2020-06-03 11:33:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-06-03 11:33:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 72 ms returned sat
[2020-06-03 11:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:04] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-06-03 11:33:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 11:33:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 11:33:04] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 37 ms.
[2020-06-03 11:33:05] [INFO ] Added : 123 causal constraints over 25 iterations in 1165 ms. Result :sat
[2020-06-03 11:33:05] [INFO ] Deduced a trap composed of 12 places in 97 ms
[2020-06-03 11:33:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 11:33:05] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-06-03 11:33:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 11:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:06] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2020-06-03 11:33:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 11:33:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 74 ms returned sat
[2020-06-03 11:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:06] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2020-06-03 11:33:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 11:33:06] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 53 ms.
[2020-06-03 11:33:07] [INFO ] Added : 122 causal constraints over 25 iterations in 1014 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-03 11:33:08] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-06-03 11:33:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2020-06-03 11:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:08] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-06-03 11:33:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 11:33:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 6 ms returned unsat
[2020-06-03 11:33:08] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-06-03 11:33:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2020-06-03 11:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:08] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2020-06-03 11:33:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 11:33:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 11:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:09] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2020-06-03 11:33:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 11:33:09] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 30 ms.
[2020-06-03 11:33:10] [INFO ] Added : 120 causal constraints over 25 iterations in 974 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 11:33:10] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2020-06-03 11:33:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2020-06-03 11:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:11] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2020-06-03 11:33:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 80 ms returned sat
[2020-06-03 11:33:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 156 ms returned sat
[2020-06-03 11:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:12] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2020-06-03 11:33:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2020-06-03 11:33:12] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 31 ms.
[2020-06-03 11:33:12] [INFO ] Added : 92 causal constraints over 19 iterations in 752 ms. Result :sat
[2020-06-03 11:33:12] [INFO ] Deduced a trap composed of 13 places in 105 ms
[2020-06-03 11:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
FORMULA DES-PT-20a-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 50200 steps, including 1292 resets, run finished after 312 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 87700 steps, including 1946 resets, run finished after 398 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 100500 steps, including 2448 resets, run finished after 445 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 111200 steps, including 2529 resets, run finished after 494 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 195 transition count 136
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 194 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 194 transition count 135
Applied a total of 11 rules in 183 ms. Remains 194 /195 variables (removed 1) and now considering 135/138 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/195 places, 135/138 transitions.
Incomplete random walk after 1000000 steps, including 13492 resets, run finished after 3827 ms. (steps per millisecond=261 ) properties seen :[1, 1, 0, 0]
FORMULA DES-PT-20a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2132 resets, run finished after 2148 ms. (steps per millisecond=465 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2630 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties seen :[0, 0]
// Phase 1: matrix 135 rows 194 cols
[2020-06-03 11:33:22] [INFO ] Computed 61 place invariants in 13 ms
[2020-06-03 11:33:22] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 11:33:22] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 39 ms returned sat
[2020-06-03 11:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:23] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2020-06-03 11:33:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-06-03 11:33:23] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 273 ms returned sat
[2020-06-03 11:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:24] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2020-06-03 11:33:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-03 11:33:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 62 ms returned sat
[2020-06-03 11:33:24] [INFO ] Deduced a trap composed of 21 places in 41 ms
[2020-06-03 11:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-06-03 11:33:24] [INFO ] Computed and/alt/rep : 134/636/134 causal constraints in 29 ms.
[2020-06-03 11:33:25] [INFO ] Added : 120 causal constraints over 24 iterations in 917 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 11:33:25] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-06-03 11:33:25] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 11:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:25] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2020-06-03 11:33:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:33:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 11:33:26] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 334 ms returned sat
[2020-06-03 11:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:33:26] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-06-03 11:33:26] [INFO ] [Nat]Added 5 Read/Feed constraints in 15 ms returned sat
[2020-06-03 11:33:26] [INFO ] Deduced a trap composed of 11 places in 78 ms
[2020-06-03 11:33:26] [INFO ] Deduced a trap composed of 21 places in 23 ms
[2020-06-03 11:33:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2020-06-03 11:33:26] [INFO ] Computed and/alt/rep : 134/636/134 causal constraints in 17 ms.
[2020-06-03 11:33:27] [INFO ] Added : 105 causal constraints over 21 iterations in 859 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 48800 steps, including 734 resets, run finished after 197 ms. (steps per millisecond=247 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 77400 steps, including 1173 resets, run finished after 281 ms. (steps per millisecond=275 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 135/135 transitions.
Applied a total of 0 rules in 17 ms. Remains 194 /194 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 135/135 transitions.
Incomplete random walk after 1000000 steps, including 13445 resets, run finished after 3622 ms. (steps per millisecond=276 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2119 resets, run finished after 2132 ms. (steps per millisecond=469 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2653 resets, run finished after 1822 ms. (steps per millisecond=548 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8949892 steps, run timeout after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0]
Probabilistic random walk after 8949892 steps, saw 1140309 distinct states, run finished after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0]
// Phase 1: matrix 135 rows 194 cols
[2020-06-03 11:34:05] [INFO ] Computed 61 place invariants in 8 ms
[2020-06-03 11:34:06] [INFO ] [Real]Absence check using 36 positive place invariants in 55 ms returned sat
[2020-06-03 11:34:06] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 71 ms returned sat
[2020-06-03 11:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:06] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2020-06-03 11:34:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:34:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 11:34:07] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 370 ms returned sat
[2020-06-03 11:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:07] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2020-06-03 11:34:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-03 11:34:07] [INFO ] [Nat]Added 5 Read/Feed constraints in 49 ms returned sat
[2020-06-03 11:34:07] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 11:34:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2020-06-03 11:34:07] [INFO ] Computed and/alt/rep : 134/636/134 causal constraints in 39 ms.
[2020-06-03 11:34:08] [INFO ] Added : 120 causal constraints over 24 iterations in 1074 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 11:34:09] [INFO ] [Real]Absence check using 36 positive place invariants in 50 ms returned sat
[2020-06-03 11:34:09] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 24 ms returned sat
[2020-06-03 11:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:09] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2020-06-03 11:34:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:34:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-06-03 11:34:10] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 354 ms returned sat
[2020-06-03 11:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:10] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2020-06-03 11:34:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 27 ms returned sat
[2020-06-03 11:34:10] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2020-06-03 11:34:11] [INFO ] Deduced a trap composed of 21 places in 65 ms
[2020-06-03 11:34:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2020-06-03 11:34:11] [INFO ] Computed and/alt/rep : 134/636/134 causal constraints in 69 ms.
[2020-06-03 11:34:12] [INFO ] Added : 105 causal constraints over 21 iterations in 942 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 48800 steps, including 737 resets, run finished after 176 ms. (steps per millisecond=277 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 77400 steps, including 1176 resets, run finished after 277 ms. (steps per millisecond=279 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 135/135 transitions.
Applied a total of 0 rules in 14 ms. Remains 194 /194 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 135/135 transitions.
Starting structural reductions, iteration 0 : 194/194 places, 135/135 transitions.
Applied a total of 0 rules in 15 ms. Remains 194 /194 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 194 cols
[2020-06-03 11:34:12] [INFO ] Computed 61 place invariants in 6 ms
[2020-06-03 11:34:13] [INFO ] Implicit Places using invariants in 619 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 642 ms to find 1 implicit places.
[2020-06-03 11:34:13] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:34:13] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 11:34:14] [INFO ] Dead Transitions using invariants and state equation in 814 ms returned []
Starting structural reductions, iteration 1 : 193/194 places, 135/135 transitions.
Applied a total of 0 rules in 16 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2020-06-03 11:34:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:34:14] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 11:34:14] [INFO ] Dead Transitions using invariants and state equation in 854 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/194 places, 135/135 transitions.
Incomplete random walk after 1000000 steps, including 13410 resets, run finished after 3816 ms. (steps per millisecond=262 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2106 resets, run finished after 2264 ms. (steps per millisecond=441 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2661 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9150494 steps, run timeout after 30001 ms. (steps per millisecond=305 ) properties seen :[0, 0]
Probabilistic random walk after 9150494 steps, saw 1165362 distinct states, run finished after 30001 ms. (steps per millisecond=305 ) properties seen :[0, 0]
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:34:53] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 11:34:53] [INFO ] [Real]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 11:34:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 11:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:53] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2020-06-03 11:34:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 11:34:53] [INFO ] [Real]Added 3 Read/Feed constraints in 6 ms returned sat
[2020-06-03 11:34:53] [INFO ] Computed and/alt/rep : 134/632/134 causal constraints in 30 ms.
[2020-06-03 11:34:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:34:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 51 ms returned sat
[2020-06-03 11:34:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2020-06-03 11:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:54] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2020-06-03 11:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 41 ms returned sat
[2020-06-03 11:34:54] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-06-03 11:34:54] [INFO ] Deduced a trap composed of 11 places in 56 ms
[2020-06-03 11:34:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2020-06-03 11:34:54] [INFO ] Computed and/alt/rep : 134/632/134 causal constraints in 47 ms.
[2020-06-03 11:34:55] [INFO ] Added : 123 causal constraints over 25 iterations in 905 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 11:34:55] [INFO ] [Real]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 11:34:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 11:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:56] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2020-06-03 11:34:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:34:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 11:34:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 126 ms returned sat
[2020-06-03 11:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:34:57] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2020-06-03 11:34:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2020-06-03 11:34:57] [INFO ] Deduced a trap composed of 21 places in 29 ms
[2020-06-03 11:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-06-03 11:34:57] [INFO ] Computed and/alt/rep : 134/632/134 causal constraints in 20 ms.
[2020-06-03 11:34:58] [INFO ] Added : 108 causal constraints over 22 iterations in 961 ms. Result :sat
[2020-06-03 11:34:58] [INFO ] Deduced a trap composed of 16 places in 57 ms
[2020-06-03 11:34:58] [INFO ] Deduced a trap composed of 18 places in 80 ms
[2020-06-03 11:34:59] [INFO ] Deduced a trap composed of 17 places in 91 ms
[2020-06-03 11:34:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 74500 steps, including 1096 resets, run finished after 316 ms. (steps per millisecond=235 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 83900 steps, including 1250 resets, run finished after 346 ms. (steps per millisecond=242 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 16 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:34:59] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 11:35:01] [INFO ] Implicit Places using invariants in 1232 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:35:01] [INFO ] Computed 60 place invariants in 14 ms
[2020-06-03 11:35:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 11:35:03] [INFO ] Implicit Places using invariants and state equation in 2583 ms returned []
Implicit Place search using SMT with State Equation took 3845 ms to find 0 implicit places.
[2020-06-03 11:35:03] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:35:03] [INFO ] Computed 60 place invariants in 28 ms
[2020-06-03 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 482 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 100000 steps, including 1355 resets, run finished after 378 ms. (steps per millisecond=264 ) properties seen :[0, 0]
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:35:04] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 11:35:04] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 11:35:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 11:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:05] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2020-06-03 11:35:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 11:35:05] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2020-06-03 11:35:05] [INFO ] Computed and/alt/rep : 134/632/134 causal constraints in 43 ms.
[2020-06-03 11:35:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:35:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 53 ms returned sat
[2020-06-03 11:35:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 109 ms returned sat
[2020-06-03 11:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:06] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2020-06-03 11:35:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 39 ms returned sat
[2020-06-03 11:35:06] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2020-06-03 11:35:06] [INFO ] Deduced a trap composed of 11 places in 44 ms
[2020-06-03 11:35:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2020-06-03 11:35:06] [INFO ] Computed and/alt/rep : 134/632/134 causal constraints in 19 ms.
[2020-06-03 11:35:07] [INFO ] Added : 123 causal constraints over 25 iterations in 792 ms. Result :sat
[2020-06-03 11:35:07] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 11:35:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2020-06-03 11:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:07] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-06-03 11:35:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:35:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 11:35:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 109 ms returned sat
[2020-06-03 11:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:08] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2020-06-03 11:35:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2020-06-03 11:35:08] [INFO ] Deduced a trap composed of 21 places in 133 ms
[2020-06-03 11:35:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2020-06-03 11:35:08] [INFO ] Computed and/alt/rep : 134/632/134 causal constraints in 16 ms.
[2020-06-03 11:35:09] [INFO ] Added : 108 causal constraints over 22 iterations in 728 ms. Result :sat
[2020-06-03 11:35:09] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-06-03 11:35:09] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-06-03 11:35:09] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-06-03 11:35:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 34 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 193 cols
[2020-06-03 11:35:09] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 11:35:09] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 11:35:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2020-06-03 11:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:10] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2020-06-03 11:35:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:35:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 11:35:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 74 ms returned sat
[2020-06-03 11:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:10] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2020-06-03 11:35:10] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-06-03 11:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2020-06-03 11:35:10] [INFO ] Computed and/alt/rep : 134/627/134 causal constraints in 21 ms.
[2020-06-03 11:35:12] [INFO ] Added : 124 causal constraints over 25 iterations in 1225 ms. Result :sat
[2020-06-03 11:35:12] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2020-06-03 11:35:12] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2020-06-03 11:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-03 11:35:12] [INFO ] [Real]Absence check using 35 positive place invariants in 176 ms returned sat
[2020-06-03 11:35:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2020-06-03 11:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:13] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2020-06-03 11:35:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:35:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 154 ms returned sat
[2020-06-03 11:35:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 180 ms returned sat
[2020-06-03 11:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:35:15] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2020-06-03 11:35:15] [INFO ] Computed and/alt/rep : 134/627/134 causal constraints in 53 ms.
[2020-06-03 11:35:16] [INFO ] Added : 107 causal constraints over 22 iterations in 1167 ms. Result :sat
[2020-06-03 11:35:16] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-06-03 11:35:16] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2020-06-03 11:35:16] [INFO ] Deduced a trap composed of 16 places in 91 ms
[2020-06-03 11:35:17] [INFO ] Deduced a trap composed of 36 places in 63 ms
[2020-06-03 11:35:17] [INFO ] Deduced a trap composed of 26 places in 30 ms
[2020-06-03 11:35:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 614 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 11:35:17] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 11:35:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
[2020-06-03 11:35:17] [INFO ] Flatten gal took : 129 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-20a @ 3570 seconds

FORMULA DES-PT-20a-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ DES-PT-20a

{
"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",
"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": "Wed Jun 3 11:35:18 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p73)) AND ((p161 <= 0)))))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"edges": 288,
"markings": 261,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 7,
"aneg": 0,
"comp": 7,
"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": 7,
"visible_transitions": 0
},
"processed": "A (G (((p7 <= 0) OR (((1 <= p50)) AND ((p69 <= 0))) OR (((1 <= p88)) AND ((p44 <= 0)) AND ((1 <= p147)) AND ((p174 <= 0))))))",
"processed_size": 127,
"rewrites": 2
},
"result":
{
"edges": 673,
"markings": 674,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19844,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 698,
"conflict_clusters": 40,
"places": 193,
"places_significant": 133,
"singleton_clusters": 0,
"transitions": 135
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"task":
{
"type": "compound"
}
}
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: 328/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 193
lola: finding significant places
lola: 193 places, 135 transitions, 133 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: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: A (G (((p7 <= 0) OR (((1 <= p50)) AND ((p69 <= 0))) OR (((1 <= p88)) AND ((p44 <= 0)) AND ((1 <= p147)) AND ((p174 <= 0)))))) : E (F ((((1 <= p73)) AND ((p161 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p73)) AND ((p161 <= 0)))))
lola: ========================================
lola: SUBTASK
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 <= p73)) AND ((p161 <= 0)))))
lola: processed formula length: 40
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p73)) AND ((p161 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 261 markings, 288 edges
lola: ========================================
lola: subprocess 1 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p7 <= 0) OR (((1 <= p50)) AND ((p69 <= 0))) OR (((1 <= p88)) AND ((p44 <= 0)) AND ((1 <= p147)) AND ((p174 <= 0))))))
lola: ========================================
lola: SUBTASK
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 (((p7 <= 0) OR (((1 <= p50)) AND ((p69 <= 0))) OR (((1 <= p88)) AND ((p44 <= 0)) AND ((1 <= p147)) AND ((p174 <= 0))))))
lola: processed formula length: 127
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: 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: ((1 <= p7) AND (((p50 <= 0)) OR ((1 <= p69))) AND (((p88 <= 0)) OR ((1 <= p44)) OR ((p147 <= 0)) OR ((1 <= p174))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 674 markings, 673 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: memory consumption: 19844 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20a"
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 DES-PT-20a, 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 r180-ebro-158987899900262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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