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 |
269.384 | 20195.00 | 29187.00 | 261.80 | FFFFFTFFFFFTTFTT | 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-162124171300171.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300171
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME net-ReachabilityCardinality-01
FORMULA_NAME net-ReachabilityCardinality-02
FORMULA_NAME net-ReachabilityCardinality-03
FORMULA_NAME net-ReachabilityCardinality-04
FORMULA_NAME net-ReachabilityCardinality-05
FORMULA_NAME net-ReachabilityCardinality-06
FORMULA_NAME net-ReachabilityCardinality-07
FORMULA_NAME net-ReachabilityCardinality-08
FORMULA_NAME net-ReachabilityCardinality-09
FORMULA_NAME net-ReachabilityCardinality-10
FORMULA_NAME net-ReachabilityCardinality-11
FORMULA_NAME net-ReachabilityCardinality-12
FORMULA_NAME net-ReachabilityCardinality-13
FORMULA_NAME net-ReachabilityCardinality-14
FORMULA_NAME net-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1621341844092
[2021-05-18 12:44:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:44:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:44:05] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-18 12:44:05] [INFO ] Transformed 159 places.
[2021-05-18 12:44:05] [INFO ] Transformed 334 transitions.
[2021-05-18 12:44:05] [INFO ] Found NUPN structural information;
[2021-05-18 12:44:05] [INFO ] Parsed PT model containing 159 places and 334 transitions in 93 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 673 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 15 ms. (steps per millisecond=666 ) 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 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:44:06] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2021-05-18 12:44:06] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-18 12:44:06] [INFO ] [Real]Absence check using 10 positive place invariants in 27 ms returned sat
[2021-05-18 12:44:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-18 12:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:06] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-18 12:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:44:06] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:06] [INFO ] Deduced a trap composed of 30 places in 70 ms
[2021-05-18 12:44:06] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2021-05-18 12:44:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2021-05-18 12:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 91 ms returned sat
[2021-05-18 12:44:06] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:06] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-18 12:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:44:06] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 20 ms.
[2021-05-18 12:44:09] [INFO ] Added : 167 causal constraints over 35 iterations in 2583 ms. Result :sat
[2021-05-18 12:44:09] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2021-05-18 12:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-18 12:44:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned unsat
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:10] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:44:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2021-05-18 12:44:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:10] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:44:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:44:10] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 20 ms.
[2021-05-18 12:44:11] [INFO ] Added : 158 causal constraints over 32 iterations in 1046 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 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 125 ms returned sat
[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 301 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 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 128 ms returned sat
[2021-05-18 12:44:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-18 12:44:11] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 20 ms.
[2021-05-18 12:44:12] [INFO ] Added : 153 causal constraints over 31 iterations in 922 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 12:44:12] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 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 122 ms returned sat
[2021-05-18 12:44:13] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:13] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 16 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 365 ms returned sat
[2021-05-18 12:44:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 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 118 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 24 ms.
[2021-05-18 12:44:15] [INFO ] Added : 186 causal constraints over 38 iterations in 2000 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 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 4 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 124 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 28 ms
[2021-05-18 12:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-18 12:44:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:44:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 83 ms returned sat
[2021-05-18 12:44:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-18 12:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:16] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:44:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:44:16] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 23 ms.
[2021-05-18 12:44:17] [INFO ] Added : 155 causal constraints over 33 iterations in 1170 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:44:17] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 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 123 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 92 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:44:17] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:44:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:44:17] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2021-05-18 12:44:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-18 12:44:17] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 30 ms.
[2021-05-18 12:44:20] [INFO ] Added : 164 causal constraints over 34 iterations in 2063 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:44:20] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 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 141 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 19 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 76 ms returned sat
[2021-05-18 12:44:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 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 132 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 30 places in 29 ms
[2021-05-18 12:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-18 12:44:20] [INFO ] Computed and/alt/rep : 306/2390/294 causal constraints in 18 ms.
[2021-05-18 12:44:22] [INFO ] Added : 169 causal constraints over 34 iterations in 2045 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
FORMULA net-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 25000 steps, including 1000 resets, run finished after 134 ms. (steps per millisecond=186 ) properties seen :[0, 0, 0, 0, 1, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6500 steps, including 172 resets, run finished after 26 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 12900 steps, including 362 resets, run finished after 39 ms. (steps per millisecond=330 ) properties seen :[1, 0, 0, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15600 steps, including 811 resets, run finished after 57 ms. (steps per millisecond=273 ) properties seen :[0, 1, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15700 steps, including 505 resets, run finished after 43 ms. (steps per millisecond=365 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 20600 steps, including 1000 resets, run finished after 87 ms. (steps per millisecond=236 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 19400 steps, including 649 resets, run finished after 53 ms. (steps per millisecond=366 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 219 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 5 ms
Free SCC test removed 5 places
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (complete) has 667 edges and 154 vertex of which 145 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.20 ms
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 145 transition count 279
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 31 place count 140 transition count 274
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 31 place count 140 transition count 272
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 137 transition count 272
Symmetric choice reduction at 2 with 79 rule applications. Total rules 115 place count 137 transition count 272
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 157 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 273 place count 58 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 58 transition count 114
Symmetric choice reduction at 3 with 9 rule applications. Total rules 283 place count 58 transition count 114
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 301 place count 49 transition count 96
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 310 place count 49 transition count 87
Symmetric choice reduction at 4 with 3 rule applications. Total rules 313 place count 49 transition count 87
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 319 place count 46 transition count 78
Symmetric choice reduction at 4 with 3 rule applications. Total rules 322 place count 46 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 328 place count 43 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 336 place count 43 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 340 place count 41 transition count 62
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
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 352 place count 35 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 35 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 356 place count 33 transition count 94
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 365 place count 33 transition count 94
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 370 place count 33 transition count 89
Applied a total of 370 rules in 73 ms. Remains 33 /159 variables (removed 126) and now considering 89/307 (removed 218) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/159 places, 89/307 transitions.
Finished random walk after 50083 steps, including 8536 resets, run visited all 2 properties in 135 ms. (steps per millisecond=370 )
FORMULA net-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1621341864287
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is HealthRecord-PT-11, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171300171"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;