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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
275.144 19439.00 31414.00 221.60 TTTFFTTFTFFTTFTT 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-162124171300172.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-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 2.7K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 11 18:40 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 51K 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 1621341849007

[2021-05-18 12:44:10] [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:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:44:10] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-18 12:44:10] [INFO ] Transformed 159 places.
[2021-05-18 12:44:10] [INFO ] Transformed 334 transitions.
[2021-05-18 12:44:10] [INFO ] Found NUPN structural information;
[2021-05-18 12:44:10] [INFO ] Parsed PT model containing 159 places and 334 transitions in 92 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 105 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 657 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 101 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 59 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 97 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:44:10] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2021-05-18 12:44:10] [INFO ] Computed 18 place invariants in 17 ms
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-18 12:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:44:11] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:11] [INFO ] Deduced a trap composed of 38 places in 80 ms
[2021-05-18 12:44:11] [INFO ] Deduced a trap composed of 38 places in 52 ms
[2021-05-18 12:44:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2021-05-18 12:44:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:11] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2021-05-18 12:44:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-18 12:44:11] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 37 ms.
[2021-05-18 12:44:12] [INFO ] Added : 144 causal constraints over 29 iterations in 1001 ms. Result :sat
[2021-05-18 12:44:12] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-18 12:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:44:12] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:44:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:13] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-18 12:44:13] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-18 12:44:13] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 19 ms.
[2021-05-18 12:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-18 12:44:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:13] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-18 12:44:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:13] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 26 ms.
[2021-05-18 12:44:15] [INFO ] Added : 185 causal constraints over 38 iterations in 1876 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:44:15] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:15] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:15] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2021-05-18 12:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-18 12:44:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:15] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:44:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:44:15] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2021-05-18 12:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-18 12:44:15] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 18 ms.
[2021-05-18 12:44:17] [INFO ] Added : 155 causal constraints over 33 iterations in 1452 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:44:17] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
[2021-05-18 12:44:17] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:17] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:44:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 298 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:18] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 39 places in 56 ms
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 48 places in 45 ms
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 41 places in 39 ms
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:44:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 239 ms
[2021-05-18 12:44:18] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:18] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2021-05-18 12:44:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2021-05-18 12:44:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 75 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:18] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-18 12:44:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:18] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2021-05-18 12:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-18 12:44:18] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 20 ms.
[2021-05-18 12:44:19] [INFO ] Added : 158 causal constraints over 32 iterations in 953 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-18 12:44:19] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
[2021-05-18 12:44:20] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:20] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:20] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 20 ms.
[2021-05-18 12:44:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 291 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:20] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-18 12:44:20] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 17 ms.
[2021-05-18 12:44:21] [INFO ] Added : 146 causal constraints over 30 iterations in 927 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:44:21] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:44:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:21] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:44:21] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:21] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 18 ms.
[2021-05-18 12:44:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-18 12:44:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:22] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:44:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:22] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-18 12:44:22] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 16 ms.
[2021-05-18 12:44:23] [INFO ] Added : 155 causal constraints over 32 iterations in 1473 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 10900 steps, including 185 resets, run finished after 45 ms. (steps per millisecond=242 ) properties seen :[0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15400 steps, including 666 resets, run finished after 57 ms. (steps per millisecond=270 ) properties seen :[1, 0, 0, 1, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11500 steps, including 553 resets, run finished after 41 ms. (steps per millisecond=280 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 23000 steps, including 1000 resets, run finished after 58 ms. (steps per millisecond=396 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 23400 steps, including 611 resets, run finished after 67 ms. (steps per millisecond=349 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11900 steps, including 355 resets, run finished after 34 ms. (steps per millisecond=350 ) properties seen :[0, 0] could not realise parikh vector
Support contains 13 out of 159 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 175 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 11 ms
Free SCC test removed 5 places
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (complete) has 667 edges and 154 vertex of which 144 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.6 ms
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 144 transition count 279
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 32 place count 139 transition count 272
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 35 place count 137 transition count 271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 35 place count 137 transition count 269
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 40 place count 134 transition count 269
Symmetric choice reduction at 3 with 76 rule applications. Total rules 116 place count 134 transition count 269
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 152 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 268 place count 58 transition count 117
Symmetric choice reduction at 3 with 9 rule applications. Total rules 277 place count 58 transition count 117
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 295 place count 49 transition count 99
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 303 place count 49 transition count 91
Symmetric choice reduction at 4 with 1 rule applications. Total rules 304 place count 49 transition count 91
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 306 place count 48 transition count 88
Symmetric choice reduction at 4 with 1 rule applications. Total rules 307 place count 48 transition count 88
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 309 place count 47 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 312 place count 47 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 318 place count 44 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 44 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 43 transition count 95
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 331 place count 43 transition count 95
Applied a total of 331 rules in 62 ms. Remains 43 /159 variables (removed 116) and now considering 95/307 (removed 212) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/159 places, 95/307 transitions.
Incomplete random walk after 1000000 steps, including 66607 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties seen :[0, 1]
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 15818 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties seen :[0]
[2021-05-18 12:44:26] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 43 cols
[2021-05-18 12:44:26] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-18 12:44:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-18 12:44:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-18 12:44:26] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:26] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-18 12:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-18 12:44:26] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:44:26] [INFO ] Computed and/alt/rep : 91/1072/87 causal constraints in 7 ms.
[2021-05-18 12:44:27] [INFO ] Added : 55 causal constraints over 12 iterations in 102 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 11800 steps, including 717 resets, run finished after 30 ms. (steps per millisecond=393 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 95/95 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 43 transition count 95
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 41 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 41 transition count 90
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 1 with 2 rules applied. Total rules applied 9 place count 40 transition count 89
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 40 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 36 transition count 85
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 36 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 36 transition count 85
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 36 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 4 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 35 transition count 81
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 35 transition count 81
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 40 place count 34 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 34 transition count 75
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 34 transition count 73
Applied a total of 46 rules in 17 ms. Remains 34 /43 variables (removed 9) and now considering 73/95 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/43 places, 73/95 transitions.
Finished random walk after 114441 steps, including 7193 resets, run visited all 1 properties in 273 ms. (steps per millisecond=419 )
FORMULA net-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621341868446

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

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