About the Execution of 2020-gold for HealthRecord-PT-14
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
250.688 | 13385.00 | 20472.00 | 155.40 | FFFFTFTFTTFFTFFT | 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-162124171300183.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-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300183
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-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 1621342065963
[2021-05-18 12:47:47] [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:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:47:47] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-18 12:47:47] [INFO ] Transformed 162 places.
[2021-05-18 12:47:47] [INFO ] Transformed 347 transitions.
[2021-05-18 12:47:47] [INFO ] Found NUPN structural information;
[2021-05-18 12:47:47] [INFO ] Parsed PT model containing 162 places and 347 transitions in 94 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 847 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 95 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 10001 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 96 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 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-18 12:47:47] [INFO ] Flow matrix only has 306 transitions (discarded 12 similar events)
// Phase 1: matrix 306 rows 162 cols
[2021-05-18 12:47:47] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:47:47] [INFO ] [Real]Absence check using 10 positive place invariants in 26 ms returned sat
[2021-05-18 12:47:47] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-18 12:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:48] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-18 12:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:47:48] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-18 12:47:48] [INFO ] Computed and/alt/rep : 317/2529/305 causal constraints in 28 ms.
[2021-05-18 12:47:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 100 ms returned sat
[2021-05-18 12:47:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:48] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-18 12:47:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:47:48] [INFO ] Computed and/alt/rep : 317/2529/305 causal constraints in 23 ms.
[2021-05-18 12:47:49] [INFO ] Added : 134 causal constraints over 28 iterations in 521 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-18 12:47:49] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:49] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-18 12:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 55 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:49] [INFO ] [Nat]Absence check using state equation in 85 ms returned unsat
[2021-05-18 12:47:49] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:49] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-18 12:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 57 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:49] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:47:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:47:50] [INFO ] Computed and/alt/rep : 317/2529/305 causal constraints in 22 ms.
[2021-05-18 12:47:51] [INFO ] Added : 179 causal constraints over 36 iterations in 1758 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-18 12:47:51] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-18 12:47:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:52] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-18 12:47:52] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:47:52] [INFO ] Deduced a trap composed of 47 places in 80 ms
[2021-05-18 12:47:52] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2021-05-18 12:47:52] [INFO ] Deduced a trap composed of 56 places in 55 ms
[2021-05-18 12:47:52] [INFO ] Deduced a trap composed of 48 places in 49 ms
[2021-05-18 12:47:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 304 ms
[2021-05-18 12:47:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 59 ms returned sat
[2021-05-18 12:47:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:52] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-18 12:47:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:47:52] [INFO ] Deduced a trap composed of 46 places in 58 ms
[2021-05-18 12:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-18 12:47:52] [INFO ] Computed and/alt/rep : 317/2529/305 causal constraints in 21 ms.
[2021-05-18 12:47:53] [INFO ] Added : 162 causal constraints over 33 iterations in 1102 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2021-05-18 12:47:53] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:47:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:54] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:47:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 68 ms returned unsat
[2021-05-18 12:47:54] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:47:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:54] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:47:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 59 ms returned sat
[2021-05-18 12:47:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:47:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:54] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:47:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:47:54] [INFO ] Computed and/alt/rep : 317/2529/305 causal constraints in 19 ms.
[2021-05-18 12:47:56] [INFO ] Added : 161 causal constraints over 33 iterations in 1764 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:47:56] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
[2021-05-18 12:47:56] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:47:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:56] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 12:47:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:47:56] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2021-05-18 12:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-18 12:47:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:47:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-18 12:47:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-18 12:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:47:56] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:47:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:47:56] [INFO ] Computed and/alt/rep : 317/2529/305 causal constraints in 16 ms.
[2021-05-18 12:47:57] [INFO ] Added : 171 causal constraints over 35 iterations in 1106 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
FORMULA net-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 26100 steps, including 1353 resets, run finished after 106 ms. (steps per millisecond=246 ) properties seen :[0, 1, 1, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18900 steps, including 413 resets, run finished after 60 ms. (steps per millisecond=315 ) properties seen :[0, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24100 steps, including 914 resets, run finished after 67 ms. (steps per millisecond=359 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 20600 steps, including 1237 resets, run finished after 64 ms. (steps per millisecond=321 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 6900 steps, including 293 resets, run finished after 18 ms. (steps per millisecond=383 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 318/318 transitions.
Graph (trivial) has 246 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (complete) has 692 edges and 159 vertex of which 150 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 150 transition count 296
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 21 place count 147 transition count 293
Symmetric choice reduction at 2 with 86 rule applications. Total rules 107 place count 147 transition count 293
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 171 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 279 place count 61 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 61 transition count 121
Symmetric choice reduction at 3 with 9 rule applications. Total rules 289 place count 61 transition count 121
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 307 place count 52 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 316 place count 52 transition count 94
Symmetric choice reduction at 4 with 3 rule applications. Total rules 319 place count 52 transition count 94
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 325 place count 49 transition count 85
Symmetric choice reduction at 4 with 3 rule applications. Total rules 328 place count 49 transition count 85
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 334 place count 46 transition count 79
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 343 place count 46 transition count 70
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 347 place count 44 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 357 place count 39 transition count 99
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 363 place count 39 transition count 93
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 369 place count 33 transition count 93
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 370 place count 33 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 375 place count 32 transition count 168
Symmetric choice reduction at 7 with 1 rule applications. Total rules 376 place count 32 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 42 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 378 place count 31 transition count 126
Symmetric choice reduction at 7 with 1 rule applications. Total rules 379 place count 31 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 381 place count 30 transition count 124
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 391 place count 30 transition count 114
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 400 place count 30 transition count 114
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 406 place count 30 transition count 108
Applied a total of 406 rules in 71 ms. Remains 30 /162 variables (removed 132) and now considering 108/318 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/162 places, 108/318 transitions.
Finished random walk after 142 steps, including 14 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1621342079348
--------------------
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-14"
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-14, 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-162124171300183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-14.tgz
mv HealthRecord-PT-14 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 ;