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-162124171300188.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-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.1K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 53K 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-ReachabilityFireability-00
FORMULA_NAME net-ReachabilityFireability-01
FORMULA_NAME net-ReachabilityFireability-02
FORMULA_NAME net-ReachabilityFireability-03
FORMULA_NAME net-ReachabilityFireability-04
FORMULA_NAME net-ReachabilityFireability-05
FORMULA_NAME net-ReachabilityFireability-06
FORMULA_NAME net-ReachabilityFireability-07
FORMULA_NAME net-ReachabilityFireability-08
FORMULA_NAME net-ReachabilityFireability-09
FORMULA_NAME net-ReachabilityFireability-10
FORMULA_NAME net-ReachabilityFireability-11
FORMULA_NAME net-ReachabilityFireability-12
FORMULA_NAME net-ReachabilityFireability-13
FORMULA_NAME net-ReachabilityFireability-14
FORMULA_NAME net-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621342187420

[2021-05-18 12:49:49] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:49:49] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-18 12:49:49] [INFO ] Transformed 163 places.
[2021-05-18 12:49:49] [INFO ] Transformed 348 transitions.
[2021-05-18 12:49:49] [INFO ] Found NUPN structural information;
[2021-05-18 12:49:49] [INFO ] Parsed PT model containing 163 places and 348 transitions in 96 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 921 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:49:49] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2021-05-18 12:49:49] [INFO ] Computed 18 place invariants in 11 ms
[2021-05-18 12:49:49] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2021-05-18 12:49:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-18 12:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:50] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-18 12:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:49:50] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:50] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 33 ms.
[2021-05-18 12:49:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 41 ms returned sat
[2021-05-18 12:49:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:50] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:49:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:50] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 32 ms.
[2021-05-18 12:49:52] [INFO ] Added : 173 causal constraints over 36 iterations in 2294 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2021-05-18 12:49:52] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:53] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-18 12:49:53] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:53] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2021-05-18 12:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2021-05-18 12:49:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2021-05-18 12:49:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:53] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-18 12:49:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:53] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 26 ms.
[2021-05-18 12:49:54] [INFO ] Added : 153 causal constraints over 31 iterations in 932 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-18 12:49:54] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned unsat
[2021-05-18 12:49:54] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:49:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:54] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-18 12:49:54] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:54] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 25 ms.
[2021-05-18 12:49:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2021-05-18 12:49:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:55] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:49:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:55] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 25 ms.
[2021-05-18 12:49:57] [INFO ] Added : 196 causal constraints over 41 iterations in 2246 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using state equation in 93 ms returned unsat
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:57] [INFO ] Deduced a trap composed of 37 places in 58 ms
[2021-05-18 12:49:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:57] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:49:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:58] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2021-05-18 12:49:58] [INFO ] Deduced a trap composed of 38 places in 48 ms
[2021-05-18 12:49:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2021-05-18 12:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2021-05-18 12:49:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:58] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-18 12:49:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:58] [INFO ] Deduced a trap composed of 42 places in 55 ms
[2021-05-18 12:49:58] [INFO ] Deduced a trap composed of 40 places in 48 ms
[2021-05-18 12:49:58] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2021-05-18 12:49:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2021-05-18 12:49:58] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 21 ms.
[2021-05-18 12:50:00] [INFO ] Added : 159 causal constraints over 32 iterations in 1719 ms. Result :sat
[2021-05-18 12:50:00] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2021-05-18 12:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2021-05-18 12:50:00] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned unsat
[2021-05-18 12:50:00] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:00] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:50:00] [INFO ] Deduced a trap composed of 46 places in 71 ms
[2021-05-18 12:50:00] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-18 12:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2021-05-18 12:50:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:50:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:00] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-18 12:50:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:50:00] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 17 ms.
[2021-05-18 12:50:03] [INFO ] Added : 160 causal constraints over 33 iterations in 2145 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-18 12:50:03] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:50:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:03] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:50:03] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:50:03] [INFO ] Deduced a trap composed of 40 places in 48 ms
[2021-05-18 12:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-18 12:50:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:50:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:50:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:03] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-18 12:50:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:50:03] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2021-05-18 12:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-18 12:50:03] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 18 ms.
[2021-05-18 12:50:04] [INFO ] Added : 160 causal constraints over 32 iterations in 860 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-18 12:50:04] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:50:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:04] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:50:04] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:50:04] [INFO ] Deduced a trap composed of 40 places in 48 ms
[2021-05-18 12:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-18 12:50:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:50:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 34 ms returned sat
[2021-05-18 12:50:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:05] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:50:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:50:05] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 21 ms.
[2021-05-18 12:50:07] [INFO ] Added : 163 causal constraints over 33 iterations in 1941 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 24000 steps, including 1296 resets, run finished after 102 ms. (steps per millisecond=235 ) properties seen :[1, 1, 0, 1, 1, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19800 steps, including 1215 resets, run finished after 63 ms. (steps per millisecond=314 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18600 steps, including 683 resets, run finished after 53 ms. (steps per millisecond=350 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 20700 steps, including 983 resets, run finished after 58 ms. (steps per millisecond=356 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 650 resets, run finished after 40 ms. (steps per millisecond=367 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11900 steps, including 480 resets, run finished after 33 ms. (steps per millisecond=360 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 23400 steps, including 1568 resets, run finished after 61 ms. (steps per millisecond=383 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 204 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (complete) has 697 edges and 161 vertex of which 151 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 151 transition count 300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 149 transition count 296
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 20 place count 147 transition count 295
Symmetric choice reduction at 3 with 82 rule applications. Total rules 102 place count 147 transition count 295
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 164 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 266 place count 65 transition count 131
Symmetric choice reduction at 3 with 9 rule applications. Total rules 275 place count 65 transition count 131
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 293 place count 56 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 302 place count 56 transition count 104
Symmetric choice reduction at 4 with 2 rule applications. Total rules 304 place count 56 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 6 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 308 place count 54 transition count 98
Symmetric choice reduction at 4 with 2 rule applications. Total rules 310 place count 54 transition count 98
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 314 place count 52 transition count 94
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 319 place count 52 transition count 89
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 321 place count 51 transition count 88
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 333 place count 45 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 336 place count 45 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 339 place count 42 transition count 122
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 353 place count 42 transition count 122
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 356 place count 42 transition count 119
Applied a total of 356 rules in 74 ms. Remains 42 /163 variables (removed 121) and now considering 119/319 (removed 200) transitions.
[2021-05-18 12:50:07] [INFO ] Flow matrix only has 105 transitions (discarded 14 similar events)
// Phase 1: matrix 105 rows 42 cols
[2021-05-18 12:50:07] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 12:50:07] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned [118]
Found 1 dead transitions using SMT.
Drop transitions removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions :[118]
Starting structural reductions, iteration 1 : 42/163 places, 118/319 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 42 transition count 118
Applied a total of 14 rules in 9 ms. Remains 42 /42 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 42/163 places, 118/319 transitions.
Incomplete random walk after 1000000 steps, including 73100 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties seen :[0, 1]
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 13656 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties seen :[0]
[2021-05-18 12:50:10] [INFO ] Flow matrix only has 104 transitions (discarded 14 similar events)
// Phase 1: matrix 104 rows 42 cols
[2021-05-18 12:50:10] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 12:50:10] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-18 12:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-18 12:50:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-18 12:50:10] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:50:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:50:10] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:50:10] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-18 12:50:10] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:50:10] [INFO ] Computed and/alt/rep : 102/2647/88 causal constraints in 8 ms.
[2021-05-18 12:50:10] [INFO ] Added : 41 causal constraints over 9 iterations in 92 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 10000 steps, including 944 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 118/118 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 41 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 39 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 38 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 38 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 37 transition count 113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 37 transition count 259
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 36 transition count 256
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 36 transition count 247
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 36 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 49 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 35 transition count 198
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 35 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 34 transition count 196
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 46 place count 34 transition count 181
Applied a total of 46 rules in 31 ms. Remains 34 /42 variables (removed 8) and now considering 181/118 (removed -63) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/42 places, 181/118 transitions.
Finished random walk after 153769 steps, including 15601 resets, run visited all 1 properties in 367 ms. (steps per millisecond=418 )
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621342211846

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-15"
export BK_EXAMINATION="ReachabilityFireability"
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-15, 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 r303-tall-162124171300188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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