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-158987883100966.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 Echo-PT-d03r03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883100966
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 31 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 31 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 31 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 99K 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 Echo-PT-d03r03-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591254844755

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 07:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:14:06] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-04 07:14:06] [INFO ] Transformed 265 places.
[2020-06-04 07:14:06] [INFO ] Transformed 206 transitions.
[2020-06-04 07:14:06] [INFO ] Parsed PT model containing 265 places and 206 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 181 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Echo-PT-d03r03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 206 rows 265 cols
[2020-06-04 07:14:07] [INFO ] Computed 135 place invariants in 18 ms
[2020-06-04 07:14:07] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned unsat
[2020-06-04 07:14:07] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2020-06-04 07:14:07] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 20 ms returned unsat
[2020-06-04 07:14:07] [INFO ] [Real]Absence check using 24 positive place invariants in 16 ms returned sat
[2020-06-04 07:14:07] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 37 ms returned sat
[2020-06-04 07:14:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:14:07] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-04 07:14:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:14:07] [INFO ] [Nat]Absence check using 24 positive place invariants in 14 ms returned sat
[2020-06-04 07:14:07] [INFO ] [Nat]Absence check using 24 positive and 111 generalized place invariants in 32 ms returned sat
[2020-06-04 07:14:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:14:08] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 10 places in 96 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 25 places in 64 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 19 places in 66 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 25 places in 66 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 28 places in 58 ms
[2020-06-04 07:14:08] [INFO ] Deduced a trap composed of 24 places in 77 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 25 places in 52 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 10 places in 102 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2020-06-04 07:14:09] [INFO ] Deduced a trap composed of 19 places in 111 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 25 places in 117 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 23 places in 76 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 10 places in 89 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 27 places in 107 ms
[2020-06-04 07:14:10] [INFO ] Deduced a trap composed of 24 places in 86 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 10 places in 88 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 10 places in 63 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 28 places in 77 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 31 places in 82 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 27 places in 97 ms
[2020-06-04 07:14:11] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 35 places in 87 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 32 places in 72 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 38 places in 104 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 42 places in 113 ms
[2020-06-04 07:14:12] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-06-04 07:14:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s45 s71 s75 s78 s173 s203 s209 s210 s214 s219 s220 s221 s243 s251 s254 s263) 0)") while checking expression at index 2
[2020-06-04 07:14:12] [INFO ] [Real]Absence check using 24 positive place invariants in 20 ms returned sat
[2020-06-04 07:14:12] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 29 ms returned unsat
[2020-06-04 07:14:12] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2020-06-04 07:14:12] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 35 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 12 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 21 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 8 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 11 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 15 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 30 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 43 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 16 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 47 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 27 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 10 ms returned unsat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2020-06-04 07:14:13] [INFO ] [Real]Absence check using 24 positive and 111 generalized place invariants in 48 ms returned unsat
FORMULA Echo-PT-d03r03-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d03r03-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 6 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 206/206 transitions.
Discarding 27 places :
Also discarding 0 output transitions
Graph (complete) has 938 edges and 265 vertex of which 238 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.15 ms
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 86 ms. Remains 238 /265 variables (removed 27) and now considering 206/206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 238/265 places, 206/206 transitions.
Incomplete random walk after 1000000 steps, including 19759 resets, run finished after 3548 ms. (steps per millisecond=281 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1587 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties seen :[0]
Interrupted probabilistic random walk after 12330814 steps, run timeout after 30001 ms. (steps per millisecond=411 ) properties seen :[0]
Probabilistic random walk after 12330814 steps, saw 1469571 distinct states, run finished after 30002 ms. (steps per millisecond=410 ) properties seen :[0]
// Phase 1: matrix 206 rows 238 cols
[2020-06-04 07:14:49] [INFO ] Computed 108 place invariants in 62 ms
[2020-06-04 07:14:49] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 97 ms returned sat
[2020-06-04 07:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:14:49] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-06-04 07:14:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:14:49] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 133 ms returned sat
[2020-06-04 07:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:14:50] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2020-06-04 07:14:50] [INFO ] Computed and/alt/rep : 205/1804/205 causal constraints in 24 ms.
[2020-06-04 07:14:58] [INFO ] Added : 157 causal constraints over 45 iterations in 8451 ms. Result :unknown
Incomplete Parikh walk after 3700 steps, including 441 resets, run finished after 30 ms. (steps per millisecond=123 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2020-06-04 07:14:58] [INFO ] Computed 108 place invariants in 26 ms
[2020-06-04 07:14:59] [INFO ] Implicit Places using invariants in 971 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2020-06-04 07:14:59] [INFO ] Computed 108 place invariants in 25 ms
[2020-06-04 07:15:01] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2767 ms to find 0 implicit places.
[2020-06-04 07:15:01] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2020-06-04 07:15:01] [INFO ] Computed 108 place invariants in 33 ms
[2020-06-04 07:15:02] [INFO ] Dead Transitions using invariants and state equation in 767 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Incomplete random walk after 100000 steps, including 1975 resets, run finished after 302 ms. (steps per millisecond=331 ) properties seen :[0]
// Phase 1: matrix 206 rows 238 cols
[2020-06-04 07:15:02] [INFO ] Computed 108 place invariants in 20 ms
[2020-06-04 07:15:02] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 145 ms returned sat
[2020-06-04 07:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:15:03] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2020-06-04 07:15:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:15:03] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 139 ms returned sat
[2020-06-04 07:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:15:03] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2020-06-04 07:15:03] [INFO ] Computed and/alt/rep : 205/1804/205 causal constraints in 24 ms.
[2020-06-04 07:15:12] [INFO ] Added : 157 causal constraints over 45 iterations in 8759 ms. Result :unknown
Applied a total of 0 rules in 22 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2020-06-04 07:15:12] [INFO ] Computed 108 place invariants in 28 ms
[2020-06-04 07:15:12] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 141 ms returned sat
[2020-06-04 07:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:15:13] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2020-06-04 07:15:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:15:13] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 140 ms returned sat
[2020-06-04 07:15:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:15:13] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2020-06-04 07:15:13] [INFO ] Computed and/alt/rep : 205/1804/205 causal constraints in 15 ms.
[2020-06-04 07:15:22] [INFO ] Added : 157 causal constraints over 45 iterations in 8414 ms. Result :unknown
[2020-06-04 07:15:22] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2020-06-04 07:15:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
[2020-06-04 07:15:22] [INFO ] Flatten gal took : 81 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Echo-PT-d03r03 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ Echo-PT-d03r03

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 07:15:22 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20036,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p79 + 1 <= p73) AND (p164 + 1 <= p155))))",
"processed_size": 49,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1174,
"conflict_clusters": 23,
"places": 238,
"places_significant": 130,
"singleton_clusters": 0,
"transitions": 206
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 444/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 238
lola: finding significant places
lola: 238 places, 206 transitions, 130 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p218)
lola: LP says that atomic proposition is always false: (3 <= p178)
lola: E (F (((p79 + 1 <= p73) AND (p164 + 1 <= p155))))
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 (((p79 + 1 <= p73) AND (p164 + 1 <= p155))))
lola: processed formula length: 49
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: 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:711
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: ((p79 + 1 <= p73) AND (p164 + 1 <= p155))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: memory consumption: 20036 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d03r03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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