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.r178-tajo-158987882200327.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 Dekker-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 247K Apr 27 14:36 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 Dekker-PT-020-ReachabilityFireability-00
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-01
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-02
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-03
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-04
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-05
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-06
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-07
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-08
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-09
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-10
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-11
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-12
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-13
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-14
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591216879781

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:41:21] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-06-03 20:41:21] [INFO ] Transformed 100 places.
[2020-06-03 20:41:21] [INFO ] Transformed 440 transitions.
[2020-06-03 20:41:21] [INFO ] Found NUPN structural information;
[2020-06-03 20:41:21] [INFO ] Parsed PT model containing 100 places and 440 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
FORMULA Dekker-PT-020-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0]
[2020-06-03 20:41:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2020-06-03 20:41:21] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 20:41:21] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2020-06-03 20:41:21] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 17 ms returned sat
[2020-06-03 20:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:21] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-03 20:41:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2020-06-03 20:41:22] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-06-03 20:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:22] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-03 20:41:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:41:22] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 6 places in 9 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 6 places in 9 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:41:22] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:41:22] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 503 ms
[2020-06-03 20:41:22] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 9 ms.
[2020-06-03 20:41:22] [INFO ] Added : 21 causal constraints over 5 iterations in 60 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 5900 steps, including 98 resets, run finished after 52 ms. (steps per millisecond=113 ) properties seen :[0] could not realise parikh vector
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 37 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 440/440 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2717 ms. (steps per millisecond=368 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1377 ms. (steps per millisecond=726 ) properties seen :[0]
Interrupted probabilistic random walk after 25925992 steps, run timeout after 30001 ms. (steps per millisecond=864 ) properties seen :[0]
Probabilistic random walk after 25925992 steps, saw 244827 distinct states, run finished after 30001 ms. (steps per millisecond=864 ) properties seen :[0]
[2020-06-03 20:41:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2020-06-03 20:41:56] [INFO ] Computed 60 place invariants in 2 ms
[2020-06-03 20:41:56] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2020-06-03 20:41:56] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 9 ms returned sat
[2020-06-03 20:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:56] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-06-03 20:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-03 20:41:57] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2020-06-03 20:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:57] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-06-03 20:41:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:41:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 6 places in 11 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 6 places in 11 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-03 20:41:57] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-03 20:41:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 445 ms
[2020-06-03 20:41:57] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 12 ms.
[2020-06-03 20:41:57] [INFO ] Added : 21 causal constraints over 5 iterations in 69 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 5900 steps, including 98 resets, run finished after 34 ms. (steps per millisecond=173 ) properties seen :[0] could not realise parikh vector
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 17 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2020-06-03 20:41:57] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2020-06-03 20:41:57] [INFO ] Computed 60 place invariants in 2 ms
[2020-06-03 20:41:57] [INFO ] Implicit Places using invariants in 90 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 92 ms to find 20 implicit places.
[2020-06-03 20:41:57] [INFO ] Redundant transitions in 22 ms returned []
[2020-06-03 20:41:57] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:41:57] [INFO ] Computed 40 place invariants in 3 ms
[2020-06-03 20:41:58] [INFO ] Dead Transitions using invariants and state equation in 536 ms returned []
Starting structural reductions, iteration 1 : 80/100 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2020-06-03 20:41:58] [INFO ] Redundant transitions in 6 ms returned []
[2020-06-03 20:41:58] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:41:58] [INFO ] Computed 40 place invariants in 1 ms
[2020-06-03 20:42:00] [INFO ] Dead Transitions using invariants and state equation in 2609 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/100 places, 440/440 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2921 ms. (steps per millisecond=342 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1472 ms. (steps per millisecond=679 ) properties seen :[0]
Interrupted probabilistic random walk after 32664691 steps, run timeout after 30001 ms. (steps per millisecond=1088 ) properties seen :[0]
Probabilistic random walk after 32664691 steps, saw 318042 distinct states, run finished after 30002 ms. (steps per millisecond=1088 ) properties seen :[0]
[2020-06-03 20:42:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:42:35] [INFO ] Computed 40 place invariants in 1 ms
[2020-06-03 20:42:35] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2020-06-03 20:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:35] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-03 20:42:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:42:35] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-03 20:42:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 132 ms
[2020-06-03 20:42:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:42:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2020-06-03 20:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:35] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-06-03 20:42:35] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:42:35] [INFO ] Deduced a trap composed of 4 places in 6 ms
[2020-06-03 20:42:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 78 ms
[2020-06-03 20:42:35] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 12 ms.
[2020-06-03 20:42:35] [INFO ] Added : 21 causal constraints over 5 iterations in 68 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 5100 steps, including 98 resets, run finished after 61 ms. (steps per millisecond=83 ) properties seen :[0] could not realise parikh vector
Support contains 30 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 17 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2020-06-03 20:42:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:42:35] [INFO ] Computed 40 place invariants in 1 ms
[2020-06-03 20:42:36] [INFO ] Implicit Places using invariants in 87 ms returned []
[2020-06-03 20:42:36] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:42:36] [INFO ] Computed 40 place invariants in 0 ms
[2020-06-03 20:42:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:42:36] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2020-06-03 20:42:36] [INFO ] Redundant transitions in 9 ms returned []
[2020-06-03 20:42:36] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:42:36] [INFO ] Computed 40 place invariants in 1 ms
[2020-06-03 20:42:36] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 369 ms. (steps per millisecond=271 ) properties seen :[0]
[2020-06-03 20:42:36] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2020-06-03 20:42:36] [INFO ] Computed 40 place invariants in 1 ms
[2020-06-03 20:42:36] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2020-06-03 20:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:36] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-03 20:42:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:42:36] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-03 20:42:36] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-03 20:42:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 135 ms
[2020-06-03 20:42:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:42:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-03 20:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-06-03 20:42:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:42:37] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:42:37] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-03 20:42:37] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:42:37] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:42:37] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:42:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 107 ms
[2020-06-03 20:42:37] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 15 ms.
[2020-06-03 20:42:37] [INFO ] Added : 21 causal constraints over 5 iterations in 98 ms. Result :sat
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 80 transition count 80
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 375 place count 80 transition count 65
Ensure Unique test removed 15 places
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 420 place count 50 transition count 50
Applied a total of 420 rules in 31 ms. Remains 50 /80 variables (removed 30) and now considering 50/440 (removed 390) transitions.
// Phase 1: matrix 50 rows 50 cols
[2020-06-03 20:42:37] [INFO ] Computed 25 place invariants in 0 ms
[2020-06-03 20:42:37] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2020-06-03 20:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:37] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-03 20:42:37] [INFO ] Computed and/alt/rep : 30/40/30 causal constraints in 3 ms.
[2020-06-03 20:42:37] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2020-06-03 20:42:37] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2020-06-03 20:42:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2020-06-03 20:42:37] [INFO ] Flatten gal took : 87 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Dekker-PT-020 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ Dekker-PT-020

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:42:37 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 32360,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (G (((p19 <= 0) OR (p31 <= 0) OR (p70 <= 0) OR (p13 <= 0) OR (p39 <= 0) OR (p78 <= 0) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p52)) OR (((p25 <= 0) OR (p65 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p18 <= 0) OR (p20 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR (p26 <= 0) OR (p28 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p38 <= 0) OR (p42 <= 0))))))",
"processed_size": 473,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 2820,
"conflict_clusters": 1,
"places": 80,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 440
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 72,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 520/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 440 transitions, 40 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: A (G (((p19 <= 0) OR (p31 <= 0) OR (p70 <= 0) OR (p13 <= 0) OR (p39 <= 0) OR (p78 <= 0) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p52)) OR (((p25 <= 0) OR (p65 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p18 <= 0) OR (p20 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR (p26 <= 0) OR (p28 <= 0) OR (p30 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p36 <= 0) OR (p38 <= 0) OR (p42 <= 0))))))
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 (((p19 <= 0) OR (p31 <= 0) OR (p70 <= 0) OR (p13 <= 0) OR (p39 <= 0) OR (p78 <= 0) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p52)) OR (((p25 <= 0) OR (p65 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p6 <= 0) OR (p8 <= 0) OR (p10 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p18 <= 0) OR (p20 <= 0) OR (p22 <= 0) OR (p24 <= 0) OR (p26 <= 0) OR (p28 <= 0) OR (p30 <= 0) OR (p... (shortened)
lola: processed formula length: 473
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: 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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p19) AND (1 <= p31) AND (1 <= p70) AND (1 <= p13) AND (1 <= p39) AND (1 <= p78) AND ((p5 <= 0) OR (p13 <= 0) OR (p52 <= 0)) AND (((1 <= p25) AND (1 <= p65)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p6) AND (1 <= p8) AND (1 <= p10) AND (1 <= p12) AND (1 <= p14) AND (1 <= p16) AND (1 <= p18) AND (1 <= p20) AND (1 <= p22) AND (1 <= p24) AND (1 <= p26) AND (1 <= p28) AND (1 <= p30) AND (1 <= p32) AND (1 <= p34) AND (1 <= p36) AND (1 <= p38) AND (1 <= p42))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 4 conjunctive subformulas
lola: memory consumption: 32360 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="Dekker-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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