Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171200163.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is HealthRecord-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 49K May 12 08:13 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 net-ReachabilityCardinality-00
FORMULA_NAME net-ReachabilityCardinality-01
FORMULA_NAME net-ReachabilityCardinality-02
FORMULA_NAME net-ReachabilityCardinality-03
FORMULA_NAME net-ReachabilityCardinality-04
FORMULA_NAME net-ReachabilityCardinality-05
FORMULA_NAME net-ReachabilityCardinality-06
FORMULA_NAME net-ReachabilityCardinality-07
FORMULA_NAME net-ReachabilityCardinality-08
FORMULA_NAME net-ReachabilityCardinality-09
FORMULA_NAME net-ReachabilityCardinality-10
FORMULA_NAME net-ReachabilityCardinality-11
FORMULA_NAME net-ReachabilityCardinality-12
FORMULA_NAME net-ReachabilityCardinality-13
FORMULA_NAME net-ReachabilityCardinality-14
FORMULA_NAME net-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621341673444

[2021-05-18 12:41:24] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:41:24] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-18 12:41:24] [INFO ] Transformed 157 places.
[2021-05-18 12:41:24] [INFO ] Transformed 327 transitions.
[2021-05-18 12:41:24] [INFO ] Found NUPN structural information;
[2021-05-18 12:41:24] [INFO ] Parsed PT model containing 157 places and 327 transitions in 113 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 585 resets, run finished after 106 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:41:24] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2021-05-18 12:41:24] [INFO ] Computed 18 place invariants in 9 ms
[2021-05-18 12:41:25] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:41:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:25] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-18 12:41:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 54 ms returned sat
[2021-05-18 12:41:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:25] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-18 12:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:41:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:41:25] [INFO ] Deduced a trap composed of 44 places in 136 ms
[2021-05-18 12:41:25] [INFO ] Deduced a trap composed of 39 places in 122 ms
[2021-05-18 12:41:25] [INFO ] Deduced a trap composed of 30 places in 92 ms
[2021-05-18 12:41:26] [INFO ] Deduced a trap composed of 39 places in 64 ms
[2021-05-18 12:41:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2021-05-18 12:41:26] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 63 ms.
[2021-05-18 12:41:27] [INFO ] Added : 157 causal constraints over 32 iterations in 1279 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:41:27] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:41:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:27] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:41:27] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2021-05-18 12:41:27] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 21 ms.
[2021-05-18 12:41:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 12:41:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:27] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:41:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:41:28] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 47 ms.
[2021-05-18 12:41:29] [INFO ] Added : 172 causal constraints over 36 iterations in 1518 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:41:29] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-18 12:41:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:29] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:41:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 64 ms returned sat
[2021-05-18 12:41:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:29] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:41:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:41:29] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2021-05-18 12:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-18 12:41:30] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 22 ms.
[2021-05-18 12:41:30] [INFO ] Added : 149 causal constraints over 31 iterations in 796 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-18 12:41:30] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:30] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:41:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:41:31] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 22 ms.
[2021-05-18 12:41:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 112 ms returned sat
[2021-05-18 12:41:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:31] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-18 12:41:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:31] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 20 ms.
[2021-05-18 12:41:32] [INFO ] Added : 176 causal constraints over 36 iterations in 887 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:41:32] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:32] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:41:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 44 ms returned sat
[2021-05-18 12:41:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:32] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:41:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:32] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2021-05-18 12:41:32] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:41:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2021-05-18 12:41:32] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 17 ms.
[2021-05-18 12:41:34] [INFO ] Added : 166 causal constraints over 34 iterations in 1369 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-18 12:41:34] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:41:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:34] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-18 12:41:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:41:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:34] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-18 12:41:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:34] [INFO ] Deduced a trap composed of 40 places in 57 ms
[2021-05-18 12:41:34] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2021-05-18 12:41:34] [INFO ] Deduced a trap composed of 42 places in 38 ms
[2021-05-18 12:41:34] [INFO ] Deduced a trap composed of 42 places in 45 ms
[2021-05-18 12:41:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 232 ms
[2021-05-18 12:41:34] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 21 ms.
[2021-05-18 12:41:36] [INFO ] Added : 162 causal constraints over 34 iterations in 1267 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:41:36] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:41:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:36] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-18 12:41:36] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:41:36] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2021-05-18 12:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-18 12:41:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:41:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:36] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-18 12:41:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:36] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 13 ms.
[2021-05-18 12:41:37] [INFO ] Added : 157 causal constraints over 35 iterations in 1366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:41:38] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:41:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:38] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:41:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:41:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 29 ms returned sat
[2021-05-18 12:41:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:41:38] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-18 12:41:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:41:38] [INFO ] Computed and/alt/rep : 300/2310/288 causal constraints in 15 ms.
[2021-05-18 12:41:39] [INFO ] Added : 171 causal constraints over 35 iterations in 1223 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 10800 steps, including 214 resets, run finished after 47 ms. (steps per millisecond=229 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12500 steps, including 506 resets, run finished after 43 ms. (steps per millisecond=290 ) properties seen :[0, 0, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 23300 steps, including 866 resets, run finished after 69 ms. (steps per millisecond=337 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14100 steps, including 370 resets, run finished after 36 ms. (steps per millisecond=391 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 21100 steps, including 634 resets, run finished after 52 ms. (steps per millisecond=405 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 17300 steps, including 836 resets, run finished after 42 ms. (steps per millisecond=411 ) properties seen :[0, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18800 steps, including 396 resets, run finished after 49 ms. (steps per millisecond=383 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 16600 steps, including 720 resets, run finished after 43 ms. (steps per millisecond=386 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 237 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (complete) has 653 edges and 151 vertex of which 142 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 142 transition count 270
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 38 place count 136 transition count 262
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 134 transition count 261
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 41 place count 134 transition count 258
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 129 transition count 258
Symmetric choice reduction at 3 with 76 rule applications. Total rules 125 place count 129 transition count 258
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 152 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 277 place count 53 transition count 106
Symmetric choice reduction at 3 with 10 rule applications. Total rules 287 place count 53 transition count 106
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 307 place count 43 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 315 place count 43 transition count 78
Symmetric choice reduction at 4 with 3 rule applications. Total rules 318 place count 43 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 324 place count 40 transition count 69
Symmetric choice reduction at 4 with 3 rule applications. Total rules 327 place count 40 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 333 place count 37 transition count 63
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 342 place count 37 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 344 place count 36 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 356 place count 30 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 358 place count 30 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 360 place count 28 transition count 88
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 369 place count 28 transition count 88
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 377 place count 28 transition count 88
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 382 place count 28 transition count 83
Applied a total of 382 rules in 65 ms. Remains 28 /157 variables (removed 129) and now considering 83/301 (removed 218) transitions.
[2021-05-18 12:41:40] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
// Phase 1: matrix 76 rows 28 cols
[2021-05-18 12:41:40] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-18 12:41:40] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned [74, 75, 76, 77, 78, 79, 80, 81, 82]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions :[82, 81, 80, 79, 78, 77, 76, 75, 74]
Starting structural reductions, iteration 1 : 28/157 places, 74/301 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 106 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 74
Applied a total of 2 rules in 17 ms. Remains 27 /28 variables (removed 1) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 27/157 places, 74/301 transitions.
Incomplete random walk after 1000000 steps, including 332155 resets, run finished after 1822 ms. (steps per millisecond=548 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 37922 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties seen :[0]
Finished probabilistic random walk after 1477 steps, run visited all 1 properties in 26 ms. (steps per millisecond=56 )
Probabilistic random walk after 1477 steps, saw 486 distinct states, run finished after 27 ms. (steps per millisecond=54 ) properties seen :[1]
FORMULA net-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341703520

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="HealthRecord-PT-09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is HealthRecord-PT-09, 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 r303-tall-162124171200163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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