fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171300180
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for HealthRecord-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
250.771 19200.00 29008.00 147.60 TTFFTTTTFTFTTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.0K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 52K 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 1621341992098

[2021-05-18 12:46:33] [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:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:46:33] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-18 12:46:33] [INFO ] Transformed 161 places.
[2021-05-18 12:46:33] [INFO ] Transformed 341 transitions.
[2021-05-18 12:46:33] [INFO ] Found NUPN structural information;
[2021-05-18 12:46:33] [INFO ] Parsed PT model containing 161 places and 341 transitions in 96 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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 784 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 105 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 104 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 111 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 108 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 108 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-18 12:46:34] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2021-05-18 12:46:34] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-18 12:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:34] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-18 12:46:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:46:34] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:34] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 26 ms.
[2021-05-18 12:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:34] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:46:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:34] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 35 ms.
[2021-05-18 12:46:36] [INFO ] Added : 161 causal constraints over 33 iterations in 1609 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-18 12:46:36] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:46:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:36] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:46:36] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:36] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2021-05-18 12:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2021-05-18 12:46:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 34 ms returned sat
[2021-05-18 12:46:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:37] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-18 12:46:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:37] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 27 ms.
[2021-05-18 12:46:38] [INFO ] Added : 150 causal constraints over 31 iterations in 1178 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:46:38] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:46:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:38] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:46:38] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:38] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 21 ms.
[2021-05-18 12:46:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 51 ms returned sat
[2021-05-18 12:46:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:38] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:46:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:38] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 21 ms.
[2021-05-18 12:46:40] [INFO ] Added : 166 causal constraints over 34 iterations in 1601 ms. Result :sat
[2021-05-18 12:46:40] [INFO ] Deduced a trap composed of 32 places in 36 ms
[2021-05-18 12:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned unsat
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:40] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:40] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 17 ms.
[2021-05-18 12:46:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 51 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:41] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:46:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:46:41] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 22 ms.
[2021-05-18 12:46:42] [INFO ] Added : 161 causal constraints over 33 iterations in 1113 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:46:42] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:42] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:42] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2021-05-18 12:46:42] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-18 12:46:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2021-05-18 12:46:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 53 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:42] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:46:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:42] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 45 ms.
[2021-05-18 12:46:44] [INFO ] Added : 165 causal constraints over 33 iterations in 1518 ms. Result :sat
[2021-05-18 12:46:44] [INFO ] Deduced a trap composed of 30 places in 86 ms
[2021-05-18 12:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2021-05-18 12:46:44] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:44] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:44] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-18 12:46:44] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:44] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2021-05-18 12:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:46:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:46:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:44] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:46:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:46:44] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-18 12:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2021-05-18 12:46:44] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 18 ms.
[2021-05-18 12:46:45] [INFO ] Added : 151 causal constraints over 32 iterations in 902 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-18 12:46:45] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:45] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:46:45] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:46] [INFO ] Deduced a trap composed of 57 places in 68 ms
[2021-05-18 12:46:46] [INFO ] Deduced a trap composed of 44 places in 59 ms
[2021-05-18 12:46:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 149 ms
[2021-05-18 12:46:46] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:46] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:46] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 19 ms.
[2021-05-18 12:46:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:46:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:46:46] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:46:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:46:46] [INFO ] Computed and/alt/rep : 312/2470/300 causal constraints in 16 ms.
[2021-05-18 12:46:49] [INFO ] Added : 170 causal constraints over 36 iterations in 2361 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-18 12:46:49] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:46:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned unsat
[2021-05-18 12:46:49] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
FORMULA net-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 16400 steps, including 999 resets, run finished after 84 ms. (steps per millisecond=195 ) properties seen :[0, 1, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14500 steps, including 551 resets, run finished after 57 ms. (steps per millisecond=254 ) properties seen :[1, 0, 0, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18300 steps, including 997 resets, run finished after 52 ms. (steps per millisecond=351 ) properties seen :[1, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22500 steps, including 1000 resets, run finished after 60 ms. (steps per millisecond=375 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 27100 steps, including 1000 resets, run finished after 62 ms. (steps per millisecond=437 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 9000 steps, including 494 resets, run finished after 24 ms. (steps per millisecond=375 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 16100 steps, including 546 resets, run finished after 45 ms. (steps per millisecond=357 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 219 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 8 ms
Free SCC test removed 4 places
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (complete) has 681 edges and 157 vertex of which 147 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 147 transition count 288
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 28 place count 143 transition count 281
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 140 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32 place count 140 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 139 transition count 279
Symmetric choice reduction at 3 with 79 rule applications. Total rules 113 place count 139 transition count 279
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 158 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 271 place count 60 transition count 121
Symmetric choice reduction at 3 with 9 rule applications. Total rules 280 place count 60 transition count 121
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 298 place count 51 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 306 place count 51 transition count 95
Symmetric choice reduction at 4 with 1 rule applications. Total rules 307 place count 51 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 309 place count 50 transition count 92
Symmetric choice reduction at 4 with 1 rule applications. Total rules 310 place count 50 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 49 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 314 place count 49 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -41
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 326 place count 43 transition count 129
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 327 place count 43 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 328 place count 42 transition count 344
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 343 place count 42 transition count 344
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 42 transition count 344
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 355 place count 42 transition count 333
Applied a total of 355 rules in 85 ms. Remains 42 /161 variables (removed 119) and now considering 333/313 (removed -20) transitions.
[2021-05-18 12:46:49] [INFO ] Flow matrix only has 268 transitions (discarded 65 similar events)
// Phase 1: matrix 268 rows 42 cols
[2021-05-18 12:46:49] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-18 12:46:49] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned [331, 332]
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions :[332, 331]
Starting structural reductions, iteration 1 : 42/161 places, 331/313 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 232 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 41 transition count 331
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 54 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 277
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 40 transition count 277
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 5 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 39 transition count 272
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 39 transition count 272
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 38 transition count 270
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 42 place count 38 transition count 238
Applied a total of 42 rules in 23 ms. Remains 38 /42 variables (removed 4) and now considering 238/331 (removed 93) transitions.
Finished structural reductions, in 2 iterations. Remains : 38/161 places, 238/313 transitions.
Finished random walk after 120058 steps, including 7667 resets, run visited all 1 properties in 366 ms. (steps per millisecond=328 )
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621342011298

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

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