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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 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 48K 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 1621341463692

[2021-05-18 12:37:45] [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:37:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:37:45] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-18 12:37:45] [INFO ] Transformed 155 places.
[2021-05-18 12:37:45] [INFO ] Transformed 320 transitions.
[2021-05-18 12:37:45] [INFO ] Found NUPN structural information;
[2021-05-18 12:37:45] [INFO ] Parsed PT model containing 155 places and 320 transitions in 93 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 534 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA net-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0]
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 83 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 10000 steps, including 77 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 82 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:37:45] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
// Phase 1: matrix 283 rows 155 cols
[2021-05-18 12:37:45] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:37:45] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned unsat
[2021-05-18 12:37:45] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:37:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:46] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:37:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:37:46] [INFO ] [Real]Added 1 Read/Feed constraints in 23 ms returned sat
[2021-05-18 12:37:46] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2021-05-18 12:37:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2021-05-18 12:37:46] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:37:46] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:46] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:37:46] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:46] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 33 ms.
[2021-05-18 12:37:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 36 ms returned sat
[2021-05-18 12:37:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:46] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:37:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:37:46] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 36 ms.
[2021-05-18 12:37:47] [INFO ] Added : 163 causal constraints over 33 iterations in 948 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:37:47] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:37:47] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:47] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:37:47] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:47] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2021-05-18 12:37:48] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2021-05-18 12:37:48] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2021-05-18 12:37:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 132 ms
[2021-05-18 12:37:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 55 ms returned sat
[2021-05-18 12:37:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:48] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:37:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:37:48] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-18 12:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:37:48] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 23 ms.
[2021-05-18 12:37:49] [INFO ] Added : 152 causal constraints over 31 iterations in 1312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2021-05-18 12:37:49] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-18 12:37:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:49] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:37:49] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:49] [INFO ] Deduced a trap composed of 30 places in 40 ms
[2021-05-18 12:37:49] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2021-05-18 12:37:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2021-05-18 12:37:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 48 ms returned sat
[2021-05-18 12:37:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:50] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:37:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:37:50] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 22 ms.
[2021-05-18 12:37:51] [INFO ] Added : 143 causal constraints over 29 iterations in 862 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:37:51] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:37:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:51] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:37:51] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:37:51] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 20 ms.
[2021-05-18 12:37:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:37:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:51] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:37:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:37:51] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 16 ms.
[2021-05-18 12:37:52] [INFO ] Added : 147 causal constraints over 30 iterations in 1088 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:37:52] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:37:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:52] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-18 12:37:52] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:52] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2021-05-18 12:37:52] [INFO ] Deduced a trap composed of 30 places in 38 ms
[2021-05-18 12:37:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2021-05-18 12:37:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:37:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:53] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-18 12:37:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-18 12:37:53] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2021-05-18 12:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-18 12:37:53] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 20 ms.
[2021-05-18 12:37:55] [INFO ] Added : 153 causal constraints over 32 iterations in 1852 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-18 12:37:55] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:55] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:37:55] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-18 12:37:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2021-05-18 12:37:55] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:55] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:37:55] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2021-05-18 12:37:55] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:37:55] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:37:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 123 ms
[2021-05-18 12:37:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 52 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:55] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-18 12:37:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:37:55] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2021-05-18 12:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-18 12:37:55] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 31 ms.
[2021-05-18 12:37:57] [INFO ] Added : 150 causal constraints over 30 iterations in 1335 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:37:57] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
[2021-05-18 12:37:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:37:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:57] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:37:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:57] [INFO ] Deduced a trap composed of 31 places in 36 ms
[2021-05-18 12:37:57] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2021-05-18 12:37:57] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2021-05-18 12:37:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2021-05-18 12:37:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:37:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:37:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:37:57] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-18 12:37:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:37:57] [INFO ] Deduced a trap composed of 30 places in 40 ms
[2021-05-18 12:37:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-18 12:37:57] [INFO ] Computed and/alt/rep : 294/2230/282 causal constraints in 14 ms.
[2021-05-18 12:37:59] [INFO ] Added : 154 causal constraints over 31 iterations in 1383 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 17900 steps, including 666 resets, run finished after 77 ms. (steps per millisecond=232 ) properties seen :[0, 1, 0, 1, 0, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16700 steps, including 639 resets, run finished after 63 ms. (steps per millisecond=265 ) properties seen :[0, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15700 steps, including 375 resets, run finished after 43 ms. (steps per millisecond=365 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 15200 steps, including 511 resets, run finished after 43 ms. (steps per millisecond=353 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 15100 steps, including 379 resets, run finished after 42 ms. (steps per millisecond=359 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 19800 steps, including 823 resets, run finished after 54 ms. (steps per millisecond=366 ) properties seen :[0] could not realise parikh vector
Finished Parikh walk after 226 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=113 )
FORMULA net-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341480577

--------------------
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-07"
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-07, 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-162124171200156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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