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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.8K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 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.0K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:16 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 43K 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-10a-ReachabilityFireability-00
FORMULA_NAME DES-PT-10a-ReachabilityFireability-01
FORMULA_NAME DES-PT-10a-ReachabilityFireability-02
FORMULA_NAME DES-PT-10a-ReachabilityFireability-03
FORMULA_NAME DES-PT-10a-ReachabilityFireability-04
FORMULA_NAME DES-PT-10a-ReachabilityFireability-05
FORMULA_NAME DES-PT-10a-ReachabilityFireability-06
FORMULA_NAME DES-PT-10a-ReachabilityFireability-07
FORMULA_NAME DES-PT-10a-ReachabilityFireability-08
FORMULA_NAME DES-PT-10a-ReachabilityFireability-09
FORMULA_NAME DES-PT-10a-ReachabilityFireability-10
FORMULA_NAME DES-PT-10a-ReachabilityFireability-11
FORMULA_NAME DES-PT-10a-ReachabilityFireability-12
FORMULA_NAME DES-PT-10a-ReachabilityFireability-13
FORMULA_NAME DES-PT-10a-ReachabilityFireability-14
FORMULA_NAME DES-PT-10a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591179089908

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:11:32] [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 10:11:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:11:33] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2020-06-03 10:11:33] [INFO ] Transformed 155 places.
[2020-06-03 10:11:33] [INFO ] Transformed 112 transitions.
[2020-06-03 10:11:33] [INFO ] Found NUPN structural information;
[2020-06-03 10:11:33] [INFO ] Parsed PT model containing 155 places and 112 transitions in 191 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 219 resets, run finished after 138 ms. (steps per millisecond=72 ) properties seen :[1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1]
FORMULA DES-PT-10a-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 110 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 98 rows 155 cols
[2020-06-03 10:11:34] [INFO ] Computed 59 place invariants in 22 ms
[2020-06-03 10:11:34] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned unsat
[2020-06-03 10:11:34] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-06-03 10:11:34] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 27 ms returned sat
[2020-06-03 10:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:34] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2020-06-03 10:11:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2020-06-03 10:11:34] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 203 ms returned sat
[2020-06-03 10:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:35] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2020-06-03 10:11:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:11:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 10:11:35] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 20 ms.
[2020-06-03 10:11:35] [INFO ] Added : 90 causal constraints over 19 iterations in 623 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 10:11:36] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2020-06-03 10:11:36] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 19 ms returned sat
[2020-06-03 10:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:36] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-06-03 10:11:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-06-03 10:11:36] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 268 ms returned sat
[2020-06-03 10:11:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:36] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-06-03 10:11:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 10:11:37] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-06-03 10:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-06-03 10:11:37] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 35 ms.
[2020-06-03 10:11:37] [INFO ] Added : 74 causal constraints over 16 iterations in 539 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-06-03 10:11:37] [INFO ] [Real]Absence check using 33 positive place invariants in 176 ms returned sat
[2020-06-03 10:11:38] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 50 ms returned sat
[2020-06-03 10:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:38] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2020-06-03 10:11:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 10:11:38] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 110 ms returned sat
[2020-06-03 10:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:38] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-06-03 10:11:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:11:38] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 17 ms.
[2020-06-03 10:11:39] [INFO ] Added : 79 causal constraints over 16 iterations in 551 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 10:11:39] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2020-06-03 10:11:39] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 10:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:39] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2020-06-03 10:11:39] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-06-03 10:11:39] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 20 ms returned sat
[2020-06-03 10:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:39] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-06-03 10:11:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 10:11:40] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 114 ms returned sat
[2020-06-03 10:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:40] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2020-06-03 10:11:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 10:11:40] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 56 ms.
[2020-06-03 10:11:40] [INFO ] Added : 77 causal constraints over 16 iterations in 425 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 10:11:40] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2020-06-03 10:11:40] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2020-06-03 10:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:41] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-03 10:11:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-06-03 10:11:41] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 183 ms returned sat
[2020-06-03 10:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:41] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2020-06-03 10:11:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:11:41] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 17 ms.
[2020-06-03 10:11:42] [INFO ] Added : 85 causal constraints over 18 iterations in 634 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 10:11:42] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 10:11:42] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 21 ms returned sat
[2020-06-03 10:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:42] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-06-03 10:11:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-06-03 10:11:42] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 43 ms returned sat
[2020-06-03 10:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:43] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2020-06-03 10:11:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:11:43] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 13 ms.
[2020-06-03 10:11:43] [INFO ] Added : 86 causal constraints over 18 iterations in 595 ms. Result :sat
[2020-06-03 10:11:43] [INFO ] Deduced a trap composed of 13 places in 38 ms
[2020-06-03 10:11:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 10:11:43] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2020-06-03 10:11:43] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 23 ms returned sat
[2020-06-03 10:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:44] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-06-03 10:11:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 85 ms returned sat
[2020-06-03 10:11:44] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 59 ms returned sat
[2020-06-03 10:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:44] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2020-06-03 10:11:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 10:11:44] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 54 ms.
[2020-06-03 10:11:45] [INFO ] Added : 85 causal constraints over 17 iterations in 509 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-03 10:11:45] [INFO ] [Real]Absence check using 33 positive place invariants in 43 ms returned unsat
FORMULA DES-PT-10a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-10a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-10a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 24700 steps, including 413 resets, run finished after 175 ms. (steps per millisecond=141 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 54400 steps, including 1008 resets, run finished after 281 ms. (steps per millisecond=193 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 32500 steps, including 320 resets, run finished after 145 ms. (steps per millisecond=224 ) properties seen :[0, 1, 1, 1, 1, 0, 0] could not realise parikh vector
FORMULA DES-PT-10a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-10a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 27500 steps, including 426 resets, run finished after 115 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 33600 steps, including 608 resets, run finished after 148 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 22800 steps, including 329 resets, run finished after 91 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 43400 steps, including 1122 resets, run finished after 202 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 97
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 155 transition count 97
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 4 place count 154 transition count 96
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 154 transition count 96
Applied a total of 7 rules in 91 ms. Remains 154 /155 variables (removed 1) and now considering 96/98 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/155 places, 96/98 transitions.
Incomplete random walk after 1000000 steps, including 18415 resets, run finished after 3671 ms. (steps per millisecond=272 ) properties seen :[1, 0, 0]
FORMULA DES-PT-10a-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7131 resets, run finished after 2467 ms. (steps per millisecond=405 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3542 resets, run finished after 2694 ms. (steps per millisecond=371 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 154 cols
[2020-06-03 10:11:55] [INFO ] Computed 60 place invariants in 13 ms
[2020-06-03 10:11:55] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2020-06-03 10:11:55] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 21 ms returned sat
[2020-06-03 10:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:55] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-03 10:11:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-06-03 10:11:55] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 10:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:56] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2020-06-03 10:11:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 10:11:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:11:56] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 13 ms.
[2020-06-03 10:11:56] [INFO ] Added : 93 causal constraints over 20 iterations in 573 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 10:11:56] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2020-06-03 10:11:56] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 20 ms returned sat
[2020-06-03 10:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:57] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-03 10:11:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-06-03 10:11:57] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 21 ms returned sat
[2020-06-03 10:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:57] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2020-06-03 10:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-06-03 10:11:57] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 13 ms.
[2020-06-03 10:11:57] [INFO ] Added : 84 causal constraints over 17 iterations in 417 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 24200 steps, including 296 resets, run finished after 108 ms. (steps per millisecond=224 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 1067 resets, run finished after 219 ms. (steps per millisecond=270 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 13 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 96/96 transitions.
Incomplete random walk after 1000000 steps, including 18356 resets, run finished after 3266 ms. (steps per millisecond=306 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7111 resets, run finished after 2378 ms. (steps per millisecond=420 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3519 resets, run finished after 2737 ms. (steps per millisecond=365 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9896991 steps, run timeout after 30001 ms. (steps per millisecond=329 ) properties seen :[0, 0]
Probabilistic random walk after 9896991 steps, saw 1183993 distinct states, run finished after 30001 ms. (steps per millisecond=329 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 154 cols
[2020-06-03 10:12:36] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 10:12:36] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 10:12:36] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 10:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:12:36] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 10:12:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:12:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 110 ms returned sat
[2020-06-03 10:12:37] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 10:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:12:37] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-06-03 10:12:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 10:12:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2020-06-03 10:12:37] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 12 ms.
[2020-06-03 10:12:37] [INFO ] Added : 93 causal constraints over 20 iterations in 454 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 10:12:38] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-06-03 10:12:38] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 10:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:12:38] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2020-06-03 10:12:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:12:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-06-03 10:12:38] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 22 ms returned sat
[2020-06-03 10:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:12:39] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-06-03 10:12:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:12:39] [INFO ] Computed and/alt/rep : 95/393/95 causal constraints in 18 ms.
[2020-06-03 10:12:39] [INFO ] Added : 84 causal constraints over 17 iterations in 528 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 24200 steps, including 312 resets, run finished after 114 ms. (steps per millisecond=212 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 1052 resets, run finished after 218 ms. (steps per millisecond=271 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 154 cols
[2020-06-03 10:12:40] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 10:12:40] [INFO ] Implicit Places using invariants in 398 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
[2020-06-03 10:12:40] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:12:40] [INFO ] Computed 59 place invariants in 5 ms
[2020-06-03 10:12:41] [INFO ] Dead Transitions using invariants and state equation in 640 ms returned []
Starting structural reductions, iteration 1 : 153/154 places, 96/96 transitions.
Applied a total of 0 rules in 12 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2020-06-03 10:12:41] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:12:41] [INFO ] Computed 59 place invariants in 3 ms
[2020-06-03 10:12:41] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 2 iterations. Remains : 153/154 places, 96/96 transitions.
Incomplete random walk after 1000000 steps, including 18483 resets, run finished after 3565 ms. (steps per millisecond=280 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7116 resets, run finished after 2227 ms. (steps per millisecond=449 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3528 resets, run finished after 2580 ms. (steps per millisecond=387 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9798959 steps, run timeout after 30001 ms. (steps per millisecond=326 ) properties seen :[0, 0]
Probabilistic random walk after 9798959 steps, saw 1173192 distinct states, run finished after 30001 ms. (steps per millisecond=326 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:13:20] [INFO ] Computed 59 place invariants in 12 ms
[2020-06-03 10:13:20] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-06-03 10:13:20] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 23 ms returned sat
[2020-06-03 10:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:20] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-03 10:13:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:13:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 10:13:20] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 10:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:21] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2020-06-03 10:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:13:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:13:21] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 16 ms.
[2020-06-03 10:13:21] [INFO ] Added : 92 causal constraints over 19 iterations in 506 ms. Result :sat
[2020-06-03 10:13:21] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2020-06-03 10:13:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-03 10:13:21] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-06-03 10:13:21] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 10:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:22] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2020-06-03 10:13:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:13:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2020-06-03 10:13:22] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 67 ms returned sat
[2020-06-03 10:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:22] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2020-06-03 10:13:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 10:13:22] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 34 ms.
[2020-06-03 10:13:23] [INFO ] Added : 86 causal constraints over 18 iterations in 679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 41100 steps, including 599 resets, run finished after 154 ms. (steps per millisecond=266 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 57000 steps, including 729 resets, run finished after 200 ms. (steps per millisecond=285 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 17 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:13:23] [INFO ] Computed 59 place invariants in 6 ms
[2020-06-03 10:13:24] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:13:24] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 10:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:13:24] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2020-06-03 10:13:24] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:13:24] [INFO ] Computed 59 place invariants in 4 ms
[2020-06-03 10:13:25] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 96/96 transitions.
Incomplete random walk after 100000 steps, including 1855 resets, run finished after 410 ms. (steps per millisecond=243 ) properties seen :[0, 0]
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:13:25] [INFO ] Computed 59 place invariants in 2 ms
[2020-06-03 10:13:25] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2020-06-03 10:13:25] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 43 ms returned sat
[2020-06-03 10:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:26] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 10:13:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:13:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2020-06-03 10:13:26] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 61 ms returned sat
[2020-06-03 10:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:26] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2020-06-03 10:13:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:13:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 10:13:26] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 11 ms.
[2020-06-03 10:13:27] [INFO ] Added : 92 causal constraints over 19 iterations in 429 ms. Result :sat
[2020-06-03 10:13:27] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2020-06-03 10:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-06-03 10:13:27] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 10:13:27] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 23 ms returned sat
[2020-06-03 10:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:27] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2020-06-03 10:13:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:13:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2020-06-03 10:13:27] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 10:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:28] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2020-06-03 10:13:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 10:13:28] [INFO ] Computed and/alt/rep : 95/391/95 causal constraints in 17 ms.
[2020-06-03 10:13:28] [INFO ] Added : 86 causal constraints over 18 iterations in 514 ms. Result :sat
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 153 cols
[2020-06-03 10:13:28] [INFO ] Computed 59 place invariants in 3 ms
[2020-06-03 10:13:28] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 10:13:28] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 19 ms returned sat
[2020-06-03 10:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:28] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-03 10:13:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:13:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2020-06-03 10:13:29] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 45 ms returned sat
[2020-06-03 10:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:29] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-06-03 10:13:29] [INFO ] Computed and/alt/rep : 95/390/95 causal constraints in 28 ms.
[2020-06-03 10:13:29] [INFO ] Added : 92 causal constraints over 19 iterations in 511 ms. Result :sat
[2020-06-03 10:13:30] [INFO ] Deduced a trap composed of 13 places in 70 ms
[2020-06-03 10:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-03 10:13:30] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-06-03 10:13:30] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 26 ms returned sat
[2020-06-03 10:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:30] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2020-06-03 10:13:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:13:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2020-06-03 10:13:30] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 83 ms returned sat
[2020-06-03 10:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:13:31] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2020-06-03 10:13:31] [INFO ] Computed and/alt/rep : 95/390/95 causal constraints in 16 ms.
[2020-06-03 10:13:31] [INFO ] Added : 88 causal constraints over 18 iterations in 576 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 10:13:31] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2020-06-03 10:13:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2020-06-03 10:13:32] [INFO ] Flatten gal took : 102 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-10a @ 3570 seconds

FORMULA DES-PT-10a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ DES-PT-10a

{
"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=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 10:13:32 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": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p33) AND (1 <= p45) AND ((p105 <= 0) OR (p121 <= 0)) AND ((p52 <= 0) OR (p62 <= 0) OR (p64 <= 0) OR (p42 <= 0) OR (p58 <= 0) OR (p60 <= 0)))))",
"processed_size": 161,
"rewrites": 1
},
"result":
{
"edges": 324,
"markings": 309,
"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": 48,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p5) AND (1 <= p72) AND (1 <= p74)) OR ((1 <= p51) AND (1 <= p144) AND (1 <= p46) AND (1 <= p67) AND (1 <= p52) AND (1 <= p62) AND (1 <= p64) AND (1 <= p9) AND (1 <= p72) AND (1 <= p74) AND ((p35 <= 0) OR (p45 <= 0)) AND ((p21 <= 0) OR (p69 <= 0))))))",
"processed_size": 267,
"rewrites": 1
},
"result":
{
"edges": 354,
"markings": 355,
"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": 51,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 26556,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 492,
"conflict_clusters": 43,
"places": 153,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 96
},
"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: 249/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 153
lola: finding significant places
lola: 153 places, 96 transitions, 94 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: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: E (F (((1 <= p33) AND (1 <= p45) AND ((p105 <= 0) OR (p121 <= 0)) AND ((p52 <= 0) OR (p62 <= 0) OR (p64 <= 0) OR (p42 <= 0) OR (p58 <= 0) OR (p60 <= 0))))) : E (F ((((1 <= p5) AND (1 <= p72) AND (1 <= p74)) OR ((1 <= p51) AND (1 <= p144) AND (1 <= p46) AND (1 <= p67) AND (1 <= p52) AND (1 <= p62) AND (1 <= p64) AND (1 <= p9) AND (1 <= p72) AND (1 <= p74) AND ((p35 <= 0) OR (p45 <= 0)) AND ((p21 <= 0) OR (p69 <= 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 <= p33) AND (1 <= p45) AND ((p105 <= 0) OR (p121 <= 0)) AND ((p52 <= 0) OR (p62 <= 0) OR (p64 <= 0) OR (p42 <= 0) OR (p58 <= 0) OR (p60 <= 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 <= p33) AND (1 <= p45) AND ((p105 <= 0) OR (p121 <= 0)) AND ((p52 <= 0) OR (p62 <= 0) OR (p64 <= 0) OR (p42 <= 0) OR (p58 <= 0) OR (p60 <= 0)))))
lola: processed formula length: 161
lola: 1 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: 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 <= p33) AND (1 <= p45) AND ((p105 <= 0) OR (p121 <= 0)) AND ((p52 <= 0) OR (p62 <= 0) OR (p64 <= 0) OR (p42 <= 0) OR (p58 <= 0) OR (p60 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 309 markings, 324 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p5) AND (1 <= p72) AND (1 <= p74)) OR ((1 <= p51) AND (1 <= p144) AND (1 <= p46) AND (1 <= p67) AND (1 <= p52) AND (1 <= p62) AND (1 <= p64) AND (1 <= p9) AND (1 <= p72) AND (1 <= p74) AND ((p35 <= 0) OR (p45 <= 0)) AND ((p21 <= 0) OR (p69 <= 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 <= p5) AND (1 <= p72) AND (1 <= p74)) OR ((1 <= p51) AND (1 <= p144) AND (1 <= p46) AND (1 <= p67) AND (1 <= p52) AND (1 <= p62) AND (1 <= p64) AND (1 <= p9) AND (1 <= p72) AND (1 <= p74) AND ((p35 <= 0) OR (p45 <= 0)) AND ((p21 <= 0) OR (p69 <= 0))))))
lola: processed formula length: 267
lola: 1 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: 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 <= p5) AND (1 <= p72) AND (1 <= p74)) OR ((1 <= p51) AND (1 <= p144) AND (1 <= p46) AND (1 <= p67) AND (1 <= p52) AND (1 <= p62) AND (1 <= p64) AND (1 <= p9) AND (1 <= p72) AND (1 <= p74) AND ((p35 <= 0) OR (p45 <= 0)) AND ((p21 <= 0) OR (p69 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 51 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 355 markings, 354 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
sara: try reading problem file ReachabilityFireability-0.sara.
lola: memory consumption: 26556 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
sara: error: :895: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
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-10a"
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 DES-PT-10a, 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 r180-ebro-158987899900247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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