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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:19 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.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 70K 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-30a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591187875312

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:38:00] [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 12:38:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:38:01] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2020-06-03 12:38:01] [INFO ] Transformed 234 places.
[2020-06-03 12:38:01] [INFO ] Transformed 191 transitions.
[2020-06-03 12:38:01] [INFO ] Found NUPN structural information;
[2020-06-03 12:38:01] [INFO ] Parsed PT model containing 234 places and 191 transitions in 257 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 80 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 219 resets, run finished after 161 ms. (steps per millisecond=62 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 0]
FORMULA DES-PT-30a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 42 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 49 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 177 rows 234 cols
[2020-06-03 12:38:01] [INFO ] Computed 59 place invariants in 37 ms
[2020-06-03 12:38:02] [INFO ] [Real]Absence check using 34 positive place invariants in 73 ms returned sat
[2020-06-03 12:38:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 69 ms returned sat
[2020-06-03 12:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:02] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-06-03 12:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:38:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 56 ms returned sat
[2020-06-03 12:38:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 112 ms returned sat
[2020-06-03 12:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:04] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2020-06-03 12:38:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 12:38:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 12:38:04] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 65 ms.
[2020-06-03 12:38:06] [INFO ] Added : 152 causal constraints over 31 iterations in 1885 ms. Result :sat
[2020-06-03 12:38:06] [INFO ] Deduced a trap composed of 12 places in 237 ms
[2020-06-03 12:38:06] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-06-03 12:38:06] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-06-03 12:38:07] [INFO ] Deduced a trap composed of 9 places in 105 ms
[2020-06-03 12:38:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 883 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-03 12:38:07] [INFO ] [Real]Absence check using 34 positive place invariants in 64 ms returned sat
[2020-06-03 12:38:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 12:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:08] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2020-06-03 12:38:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:38:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 12:38:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 103 ms returned sat
[2020-06-03 12:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:08] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-06-03 12:38:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 12:38:09] [INFO ] Deduced a trap composed of 9 places in 381 ms
[2020-06-03 12:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2020-06-03 12:38:09] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 28 ms.
[2020-06-03 12:38:10] [INFO ] Added : 148 causal constraints over 30 iterations in 1567 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 12:38:11] [INFO ] [Real]Absence check using 34 positive place invariants in 58 ms returned sat
[2020-06-03 12:38:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 12:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:11] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-06-03 12:38:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:38:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 12:38:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 93 ms returned sat
[2020-06-03 12:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:12] [INFO ] [Nat]Absence check using state equation in 191 ms returned unsat
[2020-06-03 12:38:12] [INFO ] [Real]Absence check using 34 positive place invariants in 54 ms returned sat
[2020-06-03 12:38:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 69 ms returned sat
[2020-06-03 12:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:13] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2020-06-03 12:38:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:38:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 79 ms returned sat
[2020-06-03 12:38:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 12:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:14] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2020-06-03 12:38:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 12:38:14] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-06-03 12:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-06-03 12:38:14] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 31 ms.
[2020-06-03 12:38:17] [INFO ] Added : 164 causal constraints over 33 iterations in 2180 ms. Result :sat
[2020-06-03 12:38:17] [INFO ] Deduced a trap composed of 9 places in 128 ms
[2020-06-03 12:38:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 12:38:17] [INFO ] [Real]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 12:38:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 12:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:38:17] [INFO ] [Real]Absence check using state equation in 86 ms returned unsat
FORMULA DES-PT-30a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 103900 steps, including 2342 resets, run finished after 847 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 122600 steps, including 2970 resets, run finished after 765 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 143800 steps, including 3723 resets, run finished after 623 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 234/234 places, 177/177 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 234 transition count 175
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 234 transition count 175
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 233 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 233 transition count 174
Applied a total of 10 rules in 157 ms. Remains 233 /234 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 233/234 places, 174/177 transitions.
Incomplete random walk after 1000000 steps, including 15470 resets, run finished after 4257 ms. (steps per millisecond=234 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3332 resets, run finished after 2143 ms. (steps per millisecond=466 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2978 resets, run finished after 2135 ms. (steps per millisecond=468 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2852 resets, run finished after 2105 ms. (steps per millisecond=475 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8342121 steps, run timeout after 30001 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8342121 steps, saw 1097643 distinct states, run finished after 30015 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0]
// Phase 1: matrix 174 rows 233 cols
[2020-06-03 12:39:00] [INFO ] Computed 61 place invariants in 30 ms
[2020-06-03 12:39:01] [INFO ] [Real]Absence check using 36 positive place invariants in 56 ms returned sat
[2020-06-03 12:39:01] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 65 ms returned sat
[2020-06-03 12:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:01] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-03 12:39:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:39:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-06-03 12:39:01] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 72 ms returned sat
[2020-06-03 12:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:02] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2020-06-03 12:39:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 12:39:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 36 ms returned sat
[2020-06-03 12:39:02] [INFO ] Deduced a trap composed of 31 places in 155 ms
[2020-06-03 12:39:02] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2020-06-03 12:39:02] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-06-03 12:39:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 631 ms
[2020-06-03 12:39:03] [INFO ] Computed and/alt/rep : 173/787/173 causal constraints in 23 ms.
[2020-06-03 12:39:04] [INFO ] Added : 163 causal constraints over 33 iterations in 1275 ms. Result :sat
[2020-06-03 12:39:04] [INFO ] Deduced a trap composed of 10 places in 114 ms
[2020-06-03 12:39:04] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2020-06-03 12:39:04] [INFO ] Deduced a trap composed of 18 places in 60 ms
[2020-06-03 12:39:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 12:39:04] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-06-03 12:39:04] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 28 ms returned sat
[2020-06-03 12:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:05] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2020-06-03 12:39:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:39:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 99 ms returned sat
[2020-06-03 12:39:05] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 12:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:06] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2020-06-03 12:39:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-06-03 12:39:06] [INFO ] Deduced a trap composed of 31 places in 107 ms
[2020-06-03 12:39:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2020-06-03 12:39:06] [INFO ] Computed and/alt/rep : 173/787/173 causal constraints in 20 ms.
[2020-06-03 12:39:07] [INFO ] Added : 146 causal constraints over 30 iterations in 1258 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 12:39:07] [INFO ] [Real]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-06-03 12:39:07] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 100 ms returned sat
[2020-06-03 12:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:09] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2020-06-03 12:39:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:39:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 64 ms returned sat
[2020-06-03 12:39:09] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 144 ms returned sat
[2020-06-03 12:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:10] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2020-06-03 12:39:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 22 ms returned sat
[2020-06-03 12:39:10] [INFO ] Computed and/alt/rep : 173/787/173 causal constraints in 25 ms.
[2020-06-03 12:39:11] [INFO ] Added : 81 causal constraints over 17 iterations in 914 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 66300 steps, including 725 resets, run finished after 292 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 125200 steps, including 1307 resets, run finished after 475 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 143900 steps, including 1508 resets, run finished after 644 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 26 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 233/233 places, 174/174 transitions.
Starting structural reductions, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 19 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 233 cols
[2020-06-03 12:39:13] [INFO ] Computed 61 place invariants in 8 ms
[2020-06-03 12:39:13] [INFO ] Implicit Places using invariants in 934 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 937 ms to find 1 implicit places.
[2020-06-03 12:39:14] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:39:14] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 12:39:15] [INFO ] Dead Transitions using invariants and state equation in 1052 ms returned []
Starting structural reductions, iteration 1 : 232/233 places, 174/174 transitions.
Applied a total of 0 rules in 19 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2020-06-03 12:39:15] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:39:15] [INFO ] Computed 60 place invariants in 9 ms
[2020-06-03 12:39:15] [INFO ] Dead Transitions using invariants and state equation in 705 ms returned []
Finished structural reductions, in 2 iterations. Remains : 232/233 places, 174/174 transitions.
Incomplete random walk after 1000000 steps, including 15528 resets, run finished after 3877 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3348 resets, run finished after 1992 ms. (steps per millisecond=502 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2923 resets, run finished after 1998 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2919 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8631046 steps, run timeout after 30001 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8631046 steps, saw 1140511 distinct states, run finished after 30003 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0]
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:39:55] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 12:39:55] [INFO ] [Real]Absence check using 35 positive place invariants in 101 ms returned sat
[2020-06-03 12:39:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 158 ms returned sat
[2020-06-03 12:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:57] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2020-06-03 12:39:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:39:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 62 ms returned sat
[2020-06-03 12:39:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 111 ms returned sat
[2020-06-03 12:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:39:58] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2020-06-03 12:39:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 12:39:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 61 ms returned sat
[2020-06-03 12:39:58] [INFO ] Deduced a trap composed of 31 places in 164 ms
[2020-06-03 12:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2020-06-03 12:39:58] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 23 ms.
[2020-06-03 12:40:00] [INFO ] Added : 163 causal constraints over 33 iterations in 1685 ms. Result :sat
[2020-06-03 12:40:00] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 12:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 12:40:00] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 12:40:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2020-06-03 12:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:01] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2020-06-03 12:40:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:40:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 91 ms returned sat
[2020-06-03 12:40:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 121 ms returned sat
[2020-06-03 12:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:02] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2020-06-03 12:40:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 33 ms returned sat
[2020-06-03 12:40:02] [INFO ] Deduced a trap composed of 31 places in 42 ms
[2020-06-03 12:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-06-03 12:40:02] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 24 ms.
[2020-06-03 12:40:03] [INFO ] Added : 146 causal constraints over 30 iterations in 1516 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 12:40:03] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 12:40:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 65 ms returned sat
[2020-06-03 12:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:04] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2020-06-03 12:40:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:40:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 12:40:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2020-06-03 12:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:05] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2020-06-03 12:40:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 27 ms returned sat
[2020-06-03 12:40:05] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 22 ms.
[2020-06-03 12:40:06] [INFO ] Added : 81 causal constraints over 17 iterations in 970 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Incomplete Parikh walk after 70100 steps, including 196 resets, run finished after 250 ms. (steps per millisecond=280 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA DES-PT-30a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 113700 steps, including 1318 resets, run finished after 408 ms. (steps per millisecond=278 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 125200 steps, including 1695 resets, run finished after 454 ms. (steps per millisecond=275 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 19 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 17 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:40:07] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 12:40:09] [INFO ] Implicit Places using invariants in 1529 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:40:09] [INFO ] Computed 60 place invariants in 27 ms
[2020-06-03 12:40:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 12:40:11] [INFO ] Implicit Places using invariants and state equation in 2640 ms returned []
Implicit Place search using SMT with State Equation took 4197 ms to find 0 implicit places.
[2020-06-03 12:40:11] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:40:11] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 12:40:12] [INFO ] Dead Transitions using invariants and state equation in 582 ms returned []
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 174/174 transitions.
Incomplete random walk after 100000 steps, including 1555 resets, run finished after 635 ms. (steps per millisecond=157 ) properties seen :[0, 0]
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:40:13] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 12:40:13] [INFO ] [Real]Absence check using 35 positive place invariants in 49 ms returned sat
[2020-06-03 12:40:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 63 ms returned sat
[2020-06-03 12:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:14] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2020-06-03 12:40:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:40:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 48 ms returned sat
[2020-06-03 12:40:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 109 ms returned sat
[2020-06-03 12:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:15] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2020-06-03 12:40:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 12:40:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 70 ms returned sat
[2020-06-03 12:40:15] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-06-03 12:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2020-06-03 12:40:15] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 58 ms.
[2020-06-03 12:40:17] [INFO ] Added : 163 causal constraints over 33 iterations in 1553 ms. Result :sat
[2020-06-03 12:40:17] [INFO ] Deduced a trap composed of 12 places in 60 ms
[2020-06-03 12:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-06-03 12:40:17] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 12:40:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2020-06-03 12:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:18] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2020-06-03 12:40:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:40:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 12:40:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 109 ms returned sat
[2020-06-03 12:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:19] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2020-06-03 12:40:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 37 ms returned sat
[2020-06-03 12:40:19] [INFO ] Deduced a trap composed of 31 places in 91 ms
[2020-06-03 12:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2020-06-03 12:40:19] [INFO ] Computed and/alt/rep : 173/784/173 causal constraints in 24 ms.
[2020-06-03 12:40:21] [INFO ] Added : 146 causal constraints over 30 iterations in 1576 ms. Result :sat
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 232 transition count 174
Applied a total of 1 rules in 51 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 232 cols
[2020-06-03 12:40:21] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 12:40:21] [INFO ] [Real]Absence check using 35 positive place invariants in 113 ms returned sat
[2020-06-03 12:40:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2020-06-03 12:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:22] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2020-06-03 12:40:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:40:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 116 ms returned sat
[2020-06-03 12:40:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 143 ms returned sat
[2020-06-03 12:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:23] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2020-06-03 12:40:23] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2020-06-03 12:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2020-06-03 12:40:23] [INFO ] Computed and/alt/rep : 173/783/173 causal constraints in 26 ms.
[2020-06-03 12:40:25] [INFO ] Added : 162 causal constraints over 33 iterations in 1291 ms. Result :sat
[2020-06-03 12:40:25] [INFO ] Deduced a trap composed of 19 places in 315 ms
[2020-06-03 12:40:26] [INFO ] Deduced a trap composed of 17 places in 848 ms
[2020-06-03 12:40:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1297 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-03 12:40:26] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 12:40:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 12:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:27] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2020-06-03 12:40:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:40:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 51 ms returned sat
[2020-06-03 12:40:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 128 ms returned sat
[2020-06-03 12:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:40:29] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2020-06-03 12:40:30] [INFO ] Deduced a trap composed of 8 places in 660 ms
[2020-06-03 12:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 703 ms
[2020-06-03 12:40:30] [INFO ] Computed and/alt/rep : 173/783/173 causal constraints in 54 ms.
[2020-06-03 12:40:31] [INFO ] Added : 145 causal constraints over 30 iterations in 1737 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 12:40:31] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2020-06-03 12:40:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
[2020-06-03 12:40:32] [INFO ] Flatten gal took : 187 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-30a @ 3570 seconds

FORMULA DES-PT-30a-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30a-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for ReachabilityCardinality @ DES-PT-30a

{
"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 12:40:33 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p97)) AND ((p155 <= 0)) AND ((1 <= p147)) AND ((p72 <= 0)))))",
"processed_size": 75,
"rewrites": 1
},
"result":
{
"edges": 1040,
"markings": 1041,
"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": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p102)) AND ((p160 <= 0)) AND ((1 <= p203)) AND ((p45 <= 0)))))",
"processed_size": 76,
"rewrites": 1
},
"result":
{
"edges": 62541,
"markings": 45871,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19912,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 874,
"conflict_clusters": 41,
"places": 232,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 174
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes 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: 406/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 232
lola: finding significant places
lola: 232 places, 174 transitions, 172 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: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: E (F ((((1 <= p97)) AND ((p155 <= 0)) AND ((1 <= p147)) AND ((p72 <= 0))))) : E (F ((((1 <= p102)) AND ((p160 <= 0)) AND ((1 <= p203)) AND ((p45 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p97)) AND ((p155 <= 0)) AND ((1 <= p147)) AND ((p72 <= 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 <= p97)) AND ((p155 <= 0)) AND ((1 <= p147)) AND ((p72 <= 0)))))
lola: processed formula length: 75
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 <= p97)) AND ((p155 <= 0)) AND ((1 <= p147)) AND ((p72 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1041 markings, 1040 edges
lola: ========================================
lola: subprocess 1 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p102)) AND ((p160 <= 0)) AND ((1 <= p203)) AND ((p45 <= 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 <= p102)) AND ((p160 <= 0)) AND ((1 <= p203)) AND ((p45 <= 0)))))
lola: processed formula length: 76
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 <= p102)) AND ((p160 <= 0)) AND ((1 <= p203)) AND ((p45 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 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.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45871 markings, 62541 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 19912 KB
lola: time consumption: 6 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-30a"
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-30a, 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-158987900000278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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