Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348500318.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
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 r202-smll-167840348500318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 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 HealthRecord-PT-11-ReachabilityCardinality-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678700955701

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:49:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:49:19] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-13 09:49:19] [INFO ] Transformed 159 places.
[2023-03-13 09:49:19] [INFO ] Transformed 334 transitions.
[2023-03-13 09:49:19] [INFO ] Found NUPN structural information;
[2023-03-13 09:49:19] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 682 resets, run finished after 1036 ms. (steps per millisecond=9 ) properties (out of 13) seen :2
FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-13 09:49:21] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-13 09:49:21] [INFO ] Computed 18 place invariants in 19 ms
[2023-03-13 09:49:22] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 09:49:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-13 09:49:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-13 09:49:23] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 09:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:49:23] [INFO ] After 287ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-13 09:49:23] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 6 ms to minimize.
[2023-03-13 09:49:23] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2023-03-13 09:49:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-13 09:49:23] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 3 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 491 ms
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2023-03-13 09:49:24] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 0 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 952 ms
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2023-03-13 09:49:25] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2023-03-13 09:49:26] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2023-03-13 09:49:26] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2023-03-13 09:49:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 555 ms
[2023-03-13 09:49:26] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 0 ms to minimize.
[2023-03-13 09:49:26] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-13 09:49:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-03-13 09:49:26] [INFO ] After 3393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-13 09:49:26] [INFO ] After 4490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 84 ms.
Support contains 105 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 21 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 675 edges and 158 vertex of which 153 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 22 place count 133 transition count 252
Iterating global reduction 0 with 20 rules applied. Total rules applied 42 place count 133 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 132 transition count 252
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 132 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 45 place count 132 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 131 transition count 250
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 131 transition count 250
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 131 transition count 249
Applied a total of 49 rules in 86 ms. Remains 131 /159 variables (removed 28) and now considering 249/307 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 131/159 places, 249/307 transitions.
Incomplete random walk after 10000 steps, including 660 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 524695 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 524695 steps, saw 77380 distinct states, run finished after 3006 ms. (steps per millisecond=174 ) properties seen :2
FORMULA HealthRecord-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 249 rows 131 cols
[2023-03-13 09:49:31] [INFO ] Computed 13 place invariants in 10 ms
[2023-03-13 09:49:31] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-13 09:49:31] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-13 09:49:31] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 09:49:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-13 09:49:31] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-13 09:49:31] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 09:49:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:49:32] [INFO ] After 298ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2023-03-13 09:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-13 09:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2023-03-13 09:49:32] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 749 ms
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 4 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-03-13 09:49:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 678 ms
[2023-03-13 09:49:34] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2023-03-13 09:49:34] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-13 09:49:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-03-13 09:49:34] [INFO ] After 2342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-13 09:49:34] [INFO ] After 3142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 44 ms.
Support contains 81 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 249/249 transitions.
Graph (trivial) has 32 edges and 131 vertex of which 2 / 131 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 542 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 115 transition count 220
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 115 transition count 220
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 115 transition count 218
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 115 transition count 218
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 115 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 50 place count 114 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 114 transition count 216
Applied a total of 51 rules in 57 ms. Remains 114 /131 variables (removed 17) and now considering 216/249 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 114/131 places, 216/249 transitions.
Incomplete random walk after 10000 steps, including 525 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 638451 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638451 steps, saw 92591 distinct states, run finished after 3002 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 216 rows 114 cols
[2023-03-13 09:49:38] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:49:38] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 09:49:38] [INFO ] [Real]Absence check using 4 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-13 09:49:38] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 09:49:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 09:49:38] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 09:49:39] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 09:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:49:39] [INFO ] After 143ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 09:49:39] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2023-03-13 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-13 09:49:39] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2023-03-13 09:49:39] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2023-03-13 09:49:39] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-13 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 346 ms
[2023-03-13 09:49:39] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2023-03-13 09:49:39] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-13 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 685 ms
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-13 09:49:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-03-13 09:49:41] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2023-03-13 09:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-13 09:49:41] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2023-03-13 09:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-13 09:49:41] [INFO ] After 2172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-13 09:49:41] [INFO ] After 2761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 36 ms.
Support contains 64 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 216/216 transitions.
Graph (trivial) has 18 edges and 114 vertex of which 2 / 114 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 508 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 103 transition count 196
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 103 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 102 transition count 195
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 27 place count 102 transition count 195
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 100 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 100 transition count 191
Applied a total of 31 rules in 43 ms. Remains 100 /114 variables (removed 14) and now considering 191/216 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 100/114 places, 191/216 transitions.
Incomplete random walk after 10000 steps, including 642 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 825801 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 825801 steps, saw 121547 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 191 rows 100 cols
[2023-03-13 09:49:45] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 09:49:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-13 09:49:45] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 09:49:45] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:49:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-13 09:49:45] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 09:49:45] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 09:49:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 09:49:45] [INFO ] After 111ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 09:49:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-13 09:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-13 09:49:45] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-13 09:49:45] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 25 ms.
Support contains 27 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 191/191 transitions.
Graph (trivial) has 59 edges and 100 vertex of which 2 / 100 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 444 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 98 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 97 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 97 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 96 transition count 187
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 27 place count 75 transition count 145
Iterating global reduction 2 with 21 rules applied. Total rules applied 48 place count 75 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 75 transition count 140
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 3 with 2 rules applied. Total rules applied 55 place count 74 transition count 139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 71 transition count 148
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 71 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 70 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 70 transition count 146
Applied a total of 67 rules in 42 ms. Remains 70 /100 variables (removed 30) and now considering 146/191 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 70/100 places, 146/191 transitions.
Incomplete random walk after 10000 steps, including 821 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 144 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1684252 steps, run visited all 3 properties in 2420 ms. (steps per millisecond=695 )
Probabilistic random walk after 1684252 steps, saw 240033 distinct states, run finished after 2421 ms. (steps per millisecond=695 ) properties seen :3
FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 29829 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: HealthRecord_PT_11
(NrP: 159 NrTr: 334 NrArc: 879)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec

net check time: 0m 0.000sec

init dd package: 0m 3.696sec


RS generation: 2m30.926sec


-> reachability set: #nodes 65892 (6.6e+04) #states 1,252,473,852 (9)



starting MCC model checker
--------------------------

checking: AG [p146<=1]
normalized: ~ [E [true U ~ [p146<=1]]]

abstracting: (p146<=1)
states: 1,252,473,852 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [~ [1<=p152]]
normalized: ~ [E [true U 1<=p152]]

abstracting: (1<=p152)
states: 30,723,168 (7)
-> the formula is FALSE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.093sec

checking: AG [p130<=1]
normalized: ~ [E [true U ~ [p130<=1]]]

abstracting: (p130<=1)
states: 1,252,473,852 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [p92<=1]
normalized: ~ [E [true U ~ [p92<=1]]]

abstracting: (p92<=1)
states: 1,252,473,852 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [~ [p89<=p14]]
normalized: E [true U ~ [p89<=p14]]

abstracting: (p89<=p14)
states: 1,252,473,848 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.784sec

checking: AG [p123<=p95]
normalized: ~ [E [true U ~ [p123<=p95]]]

abstracting: (p123<=p95)
states: 1,252,193,916 (9)
-> the formula is FALSE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.067sec

checking: AG [~ [[[[1<=p157 & 1<=p33] | [[~ [[p6<=p87 & p19<=0]] | ~ [[1<=p14 & p66<=p10]]] & 1<=p9]] & p118<=p155]]]
normalized: ~ [E [true U [p118<=p155 & [[1<=p9 & [~ [[p6<=p87 & p19<=0]] | ~ [[1<=p14 & p66<=p10]]]] | [1<=p157 & 1<=p33]]]]]

abstracting: (1<=p33)
states: 81,930,144 (7)
abstracting: (1<=p157)
states: 157,265,137 (8)
abstracting: (p66<=p10)
states: 949,744,508 (8)
abstracting: (1<=p14)
states: 81,930,144 (7)
abstracting: (p19<=0)
states: 1,231,744,412 (9)
abstracting: (p6<=p87)
states: 1,217,645,212 (9)
abstracting: (1<=p9)
states: 41,556,464 (7)
abstracting: (p118<=p155)
states: 1,185,169,260 (9)
-> the formula is FALSE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.426sec

checking: EF [~ [[[p51<=1 | [~ [p21<=p135] & [p87<=p106 & ~ [[[[p91<=p138 & p151<=p84] & [p32<=1 & p129<=p108]] & 1<=p157]]]]] & p9<=p112]]]
normalized: E [true U ~ [[p9<=p112 & [p51<=1 | [[p87<=p106 & ~ [[1<=p157 & [[p32<=1 & p129<=p108] & [p91<=p138 & p151<=p84]]]]] & ~ [p21<=p135]]]]]]

abstracting: (p21<=p135)
states: 1,252,473,841 (9)
abstracting: (p151<=p84)
states: 1,252,275,564 (9)
abstracting: (p91<=p138)
states: 1,164,377,740 (9)
abstracting: (p129<=p108)
states: 1,252,193,916 (9)
abstracting: (p32<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p157)
states: 157,265,137 (8)
abstracting: (p87<=p106)
states: 1,046,858,460 (9)
abstracting: (p51<=1)
states: 1,252,473,852 (9)
abstracting: (p9<=p112)
states: 1,210,917,388 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.690sec

checking: EF [~ [[~ [p56<=0] | [~ [[~ [[[[1<=p115 | 1<=p89] & ~ [p51<=p46]] & [p20<=0 | p94<=0]]] & ~ [[[[p120<=p44 | p69<=p99] | ~ [p5<=1]] & ~ [[1<=p149 & p52<=1]]]]]] | p51<=p133]]]]
normalized: E [true U ~ [[[p51<=p133 | ~ [[~ [[[~ [p5<=1] | [p120<=p44 | p69<=p99]] & ~ [[1<=p149 & p52<=1]]]] & ~ [[[p20<=0 | p94<=0] & [~ [p51<=p46] & [1<=p115 | 1<=p89]]]]]]] | ~ [p56<=0]]]]

abstracting: (p56<=0)
states: 1,098,943,004 (9)
abstracting: (1<=p89)
states: 4
abstracting: (1<=p115)
states: 12,912 (4)
abstracting: (p51<=p46)
states: 1,170,543,708 (9)
abstracting: (p94<=0)
states: 1,249,578,156 (9)
abstracting: (p20<=0)
states: 1,233,246,764 (9)
abstracting: (p52<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p149)
states: 1
abstracting: (p69<=p99)
states: 1,076,880,076 (9)
abstracting: (p120<=p44)
states: 1,187,359,932 (9)
abstracting: (p5<=1)
states: 1,252,473,852 (9)
abstracting: (p51<=p133)
states: 1,170,543,708 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.106sec

checking: EF [~ [[~ [[[1<=p71 & [[[p1<=p3 | p106<=p117] | p129<=p101] | [~ [p7<=p155] | [p117<=p0 | p74<=p68]]]] | p12<=p147]] | p111<=p55]]]
normalized: E [true U ~ [[p111<=p55 | ~ [[p12<=p147 | [1<=p71 & [[~ [p7<=p155] | [p117<=p0 | p74<=p68]] | [p129<=p101 | [p1<=p3 | p106<=p117]]]]]]]]]

abstracting: (p106<=p117)
states: 1,147,322,108 (9)
abstracting: (p1<=p3)
states: 1,233,246,764 (9)
abstracting: (p129<=p101)
states: 1,252,193,916 (9)
abstracting: (p74<=p68)
states: 1,045,090,092 (9)
abstracting: (p117<=p0)
states: 1,234,541,532 (9)
abstracting: (p7<=p155)
states: 1,213,421,260 (9)
abstracting: (1<=p71)
states: 214,789,056 (8)
abstracting: (p12<=p147)
states: 1,175,656,492 (9)
abstracting: (p111<=p55)
states: 1,252,473,851 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.486sec

checking: EF [[~ [[[p30<=0 | 1<=p103] | p97<=p15]] & [[[~ [[1<=p114 & 1<=p89]] & [[~ [1<=p0] | [1<=p88 & ~ [[p82<=p120 & 1<=p84]]]] | p73<=0]] & p66<=0] & [p62<=0 & [p22<=0 | [p112<=0 & ~ [p115<=1]]]]]]]
normalized: E [true U [[[p62<=0 & [p22<=0 | [p112<=0 & ~ [p115<=1]]]] & [p66<=0 & [[p73<=0 | [[1<=p88 & ~ [[p82<=p120 & 1<=p84]]] | ~ [1<=p0]]] & ~ [[1<=p114 & 1<=p89]]]]] & ~ [[p97<=p15 | [p30<=0 | 1<=p103]]]]]

abstracting: (1<=p103)
states: 18,187,920 (7)
abstracting: (p30<=0)
states: 1,170,543,708 (9)
abstracting: (p97<=p15)
states: 1,249,578,156 (9)
abstracting: (1<=p89)
states: 4
abstracting: (1<=p114)
states: 182,510,833 (8)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p84)
states: 189,246,416 (8)
abstracting: (p82<=p120)
states: 1,252,473,841 (9)
abstracting: (1<=p88)
states: 207,383,760 (8)
abstracting: (p73<=0)
states: 1,026,569,756 (9)
abstracting: (p66<=0)
states: 939,355,392 (8)
abstracting: (p115<=1)
states: 1,252,473,852 (9)
abstracting: (p112<=0)
states: 1,252,473,851 (9)
abstracting: (p22<=0)
states: 1,170,543,708 (9)
abstracting: (p62<=0)
states: 939,355,392 (8)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.327sec

checking: EF [~ [[[p29<=p144 | ~ [p156<=p77]] | [[~ [p138<=p13] | p133<=1] & [[[~ [[~ [1<=p100] & [1<=p44 | p6<=1]]] & [[[1<=p99 & p97<=p28] & 1<=p122] & ~ [[p56<=0 | p72<=0]]]] & [1<=p113 | [[p99<=p125 | p100<=p101] | p28<=0]]] | [~ [[~ [1<=p77] | ~ [1<=p97]]] & [p134<=1 | [~ [[p132<=1 | p115<=0]] & ~ [[p73<=1 | 1<=p132]]]]]]]]]]
normalized: E [true U ~ [[[[[[p134<=1 | [~ [[p73<=1 | 1<=p132]] & ~ [[p132<=1 | p115<=0]]]] & ~ [[~ [1<=p97] | ~ [1<=p77]]]] | [[1<=p113 | [p28<=0 | [p99<=p125 | p100<=p101]]] & [[~ [[p56<=0 | p72<=0]] & [1<=p122 & [1<=p99 & p97<=p28]]] & ~ [[[1<=p44 | p6<=1] & ~ [1<=p100]]]]]] & [p133<=1 | ~ [p138<=p13]]] | [p29<=p144 | ~ [p156<=p77]]]]]

abstracting: (p156<=p77)
states: 1,183,459,228 (9)
abstracting: (p29<=p144)
states: 1,213,108,060 (9)
abstracting: (p138<=p13)
states: 1,252,193,916 (9)
abstracting: (p133<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p100)
states: 88,192,880 (7)
abstracting: (p6<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p44)
states: 42,178,400 (7)
abstracting: (p97<=p28)
states: 1,249,578,156 (9)
abstracting: (1<=p99)
states: 88,192,880 (7)
abstracting: (1<=p122)
states: 67,304,592 (7)
abstracting: (p72<=0)
states: 1,026,569,756 (9)
abstracting: (p56<=0)
states: 1,098,943,004 (9)
abstracting: (p100<=p101)
states: 1,164,280,972 (9)
abstracting: (p99<=p125)
states: 1,164,280,972 (9)
abstracting: (p28<=0)
states: 1,210,917,388 (9)
abstracting: (1<=p113)
states: 182,510,832 (8)
abstracting: (1<=p77)
states: 189,246,416 (8)
abstracting: (1<=p97)
states: 2,895,696 (6)
abstracting: (p115<=0)
states: 1,252,460,940 (9)
abstracting: (p132<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p132)
states: 67,304,592 (7)
abstracting: (p73<=1)
states: 1,252,473,852 (9)
abstracting: (p134<=1)
states: 1,252,473,852 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.601sec

checking: EF [[p39<=0 & ~ [[[[[p77<=p9 & [~ [[1<=p32 | p152<=p69]] | p20<=p32]] | [p34<=p48 & p123<=1]] | [[[[~ [p42<=1] & [p66<=p41 & 1<=p117]] & [[1<=p141 & p60<=p107] | p147<=p137]] & [1<=p48 | [~ [p71<=0] | [p106<=0 | p56<=p106]]]] & [~ [p99<=0] & p95<=0]]] | [~ [1<=p7] & [1<=p5 & [[1<=p57 & [~ [p66<=1] & p91<=0]] | ~ [p94<=p96]]]]]]]]
normalized: E [true U [p39<=0 & ~ [[[[1<=p5 & [[1<=p57 & [p91<=0 & ~ [p66<=1]]] | ~ [p94<=p96]]] & ~ [1<=p7]] | [[[p95<=0 & ~ [p99<=0]] & [[1<=p48 | [[p106<=0 | p56<=p106] | ~ [p71<=0]]] & [[p147<=p137 | [1<=p141 & p60<=p107]] & [[p66<=p41 & 1<=p117] & ~ [p42<=1]]]]] | [[p34<=p48 & p123<=1] | [p77<=p9 & [p20<=p32 | ~ [[1<=p32 | p152<=p69]]]]]]]]]]

abstracting: (p152<=p69)
states: 1,225,620,540 (9)
abstracting: (1<=p32)
states: 81,930,144 (7)
abstracting: (p20<=p32)
states: 1,233,246,764 (9)
abstracting: (p77<=p9)
states: 1,070,026,540 (9)
abstracting: (p123<=1)
states: 1,252,473,852 (9)
abstracting: (p34<=p48)
states: 1,210,863,644 (9)
abstracting: (p42<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p117)
states: 17,932,320 (7)
abstracting: (p66<=p41)
states: 959,837,928 (8)
abstracting: (p60<=p107)
states: 939,355,392 (8)
abstracting: (1<=p141)
states: 3,068,928 (6)
abstracting: (p147<=p137)
states: 1,175,554,492 (9)
abstracting: (p71<=0)
states: 1,037,684,796 (9)
abstracting: (p56<=p106)
states: 1,109,523,564 (9)
abstracting: (p106<=0)
states: 1,147,322,108 (9)
abstracting: (1<=p48)
states: 41,556,464 (7)
abstracting: (p99<=0)
states: 1,164,280,972 (9)
abstracting: (p95<=0)
states: 1,249,578,156 (9)
abstracting: (1<=p7)
states: 41,556,464 (7)
abstracting: (p94<=p96)
states: 1,249,578,156 (9)
abstracting: (p66<=1)
states: 1,252,473,852 (9)
abstracting: (p91<=0)
states: 1,164,377,740 (9)
abstracting: (1<=p57)
states: 20,729,440 (7)
abstracting: (1<=p5)
states: 81,930,144 (7)
abstracting: (p39<=0)
states: 1,233,246,764 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.573sec

checking: EF [[[~ [[[1<=p63 | ~ [p137<=p72]] & [~ [[[p54<=p76 & p69<=1] | [p36<=1 & p140<=0]]] & [[[p134<=1 | p135<=0] & [1<=p136 & p116<=1]] & ~ [p148<=p57]]]]] | ~ [[~ [p146<=p38] & p103<=p71]]] & [~ [[[[p35<=1 & [p106<=1 & p124<=0]] | [[1<=p101 & p13<=1] & [p3<=p91 & 1<=p41]]] | [[p97<=p100 | [p120<=0 | p144<=1]] & [p42<=1 & [1<=p104 & p139<=0]]]]] & [p95<=p45 | ~ [[[[p120<=0 | p140<=0] | 1<=p36] | ~ [[p64<=0 & 1<=p101]]]]]]]]
normalized: E [true U [[[p95<=p45 | ~ [[~ [[p64<=0 & 1<=p101]] | [1<=p36 | [p120<=0 | p140<=0]]]]] & ~ [[[[p42<=1 & [1<=p104 & p139<=0]] & [p97<=p100 | [p120<=0 | p144<=1]]] | [[[p3<=p91 & 1<=p41] & [1<=p101 & p13<=1]] | [p35<=1 & [p106<=1 & p124<=0]]]]]] & [~ [[p103<=p71 & ~ [p146<=p38]]] | ~ [[[[~ [p148<=p57] & [[1<=p136 & p116<=1] & [p134<=1 | p135<=0]]] & ~ [[[p36<=1 & p140<=0] | [p54<=p76 & p69<=1]]]] & [1<=p63 | ~ [p137<=p72]]]]]]]

abstracting: (p137<=p72)
states: 1,252,240,572 (9)
abstracting: (1<=p63)
states: 11
abstracting: (p69<=1)
states: 1,252,473,852 (9)
abstracting: (p54<=p76)
states: 1,183,081,980 (9)
abstracting: (p140<=0)
states: 1,185,169,260 (9)
abstracting: (p36<=1)
states: 1,252,473,852 (9)
abstracting: (p135<=0)
states: 1,234,541,532 (9)
abstracting: (p134<=1)
states: 1,252,473,852 (9)
abstracting: (p116<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p136)
states: 67,304,592 (7)
abstracting: (p148<=p57)
states: 1,252,473,851 (9)
abstracting: (p146<=p38)
states: 1,222,469,532 (9)
abstracting: (p103<=p71)
states: 1,238,517,228 (9)
abstracting: (p124<=0)
states: 1,250,801,580 (9)
abstracting: (p106<=1)
states: 1,252,473,852 (9)
abstracting: (p35<=1)
states: 1,252,473,852 (9)
abstracting: (p13<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p101)
states: 88,192,880 (7)
abstracting: (1<=p41)
states: 81,930,144 (7)
abstracting: (p3<=p91)
states: 1,175,885,100 (9)
abstracting: (p144<=1)
states: 1,252,473,852 (9)
abstracting: (p120<=0)
states: 1,185,169,260 (9)
abstracting: (p97<=p100)
states: 1,249,578,156 (9)
abstracting: (p139<=0)
states: 1,234,541,532 (9)
abstracting: (1<=p104)
states: 22,265,408 (7)
abstracting: (p42<=1)
states: 1,252,473,852 (9)
abstracting: (p140<=0)
states: 1,185,169,260 (9)
abstracting: (p120<=0)
states: 1,185,169,260 (9)
abstracting: (1<=p36)
states: 153,530,848 (8)
abstracting: (1<=p101)
states: 88,192,880 (7)
abstracting: (p64<=0)
states: 939,355,392 (8)
abstracting: (p95<=p45)
states: 1,249,578,156 (9)

before gc: list nodes free: 1741850

after gc: idd nodes used:1099107, unused:62900893; list nodes free:274172685
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.801sec

checking: EF [[[[p10<=1 | 1<=p158] & ~ [[p59<=0 | [[[[[p63<=0 | p86<=0] & ~ [1<=p2]] | ~ [[p1<=p94 | 1<=p129]]] & p14<=p35] & [[~ [p33<=0] | p6<=p58] | ~ [1<=p84]]]]]] | ~ [[~ [[~ [[[1<=p96 | 1<=p4] | [1<=p146 & p4<=0]]] & [[[1<=p116 & p97<=1] & [[p125<=p85 | 1<=p85] | ~ [p52<=1]]] & [~ [[p66<=0 | p102<=p59]] | ~ [[p64<=0 & p92<=0]]]]]] | ~ [[p62<=p28 | [[~ [1<=p110] & 1<=p157] & [[[p148<=p4 | p4<=p34] & [p139<=0 & 1<=p40]] | [[p42<=p120 | p47<=1] & p98<=p124]]]]]]]]]
normalized: E [true U [[~ [[p59<=0 | [[p14<=p35 & [~ [[p1<=p94 | 1<=p129]] | [~ [1<=p2] & [p63<=0 | p86<=0]]]] & [~ [1<=p84] | [p6<=p58 | ~ [p33<=0]]]]]] & [p10<=1 | 1<=p158]] | ~ [[~ [[p62<=p28 | [[[p98<=p124 & [p42<=p120 | p47<=1]] | [[p139<=0 & 1<=p40] & [p148<=p4 | p4<=p34]]] & [1<=p157 & ~ [1<=p110]]]]] | ~ [[[[~ [[p64<=0 & p92<=0]] | ~ [[p66<=0 | p102<=p59]]] & [[~ [p52<=1] | [p125<=p85 | 1<=p85]] & [1<=p116 & p97<=1]]] & ~ [[[1<=p146 & p4<=0] | [1<=p96 | 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 81,930,144 (7)
abstracting: (1<=p96)
states: 2,895,696 (6)
abstracting: (p4<=0)
states: 1,170,543,708 (9)
abstracting: (1<=p146)
states: 30,723,168 (7)
abstracting: (p97<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p116)
states: 7
abstracting: (1<=p85)
states: 214,789,056 (8)
abstracting: (p125<=p85)
states: 1,252,240,572 (9)
abstracting: (p52<=1)
states: 1,252,473,852 (9)
abstracting: (p102<=p59)
states: 1,186,401,768 (9)
abstracting: (p66<=0)
states: 939,355,392 (8)
abstracting: (p92<=0)
states: 1,164,377,740 (9)
abstracting: (p64<=0)
states: 939,355,392 (8)
abstracting: (1<=p110)
states: 1
abstracting: (1<=p157)
states: 157,265,137 (8)
abstracting: (p4<=p34)
states: 1,173,680,508 (9)
abstracting: (p148<=p4)
states: 1,252,473,851 (9)
abstracting: (1<=p40)
states: 11
abstracting: (p139<=0)
states: 1,234,541,532 (9)
abstracting: (p47<=1)
states: 1,252,473,852 (9)
abstracting: (p42<=p120)
states: 1,179,886,652 (9)
abstracting: (p98<=p124)
states: 1,164,374,284 (9)
abstracting: (p62<=p28)
states: 949,744,508 (8)
abstracting: (1<=p158)
states: 1,296 (3)
abstracting: (p10<=1)
states: 1,252,473,852 (9)
abstracting: (p33<=0)
states: 1,170,543,708 (9)
abstracting: (p6<=p58)
states: 1,210,295,452 (9)
abstracting: (1<=p84)
states: 189,246,416 (8)
abstracting: (p86<=0)
states: 1,026,569,756 (9)
abstracting: (p63<=0)
states: 1,252,473,841 (9)
abstracting: (1<=p2)
states: 11
abstracting: (1<=p129)
states: 279,936 (5)
abstracting: (p1<=p94)
states: 1,233,246,764 (9)
abstracting: (p14<=p35)
states: 1,175,583,612 (9)
abstracting: (p59<=0)
states: 939,355,392 (8)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.153sec

checking: EF [[[[[[[~ [[[p58<=0 & 1<=p105] & 1<=p8]] | [[[p98<=p147 | p102<=p5] & 1<=p67] & [[1<=p138 | 1<=p88] | ~ [1<=p155]]]] & [[p130<=p146 & [[1<=p106 | p120<=p101] | p123<=p47]] | [p9<=p42 | ~ [p47<=p39]]]] & p60<=1] | [~ [1<=p96] | [~ [p144<=p38] & ~ [[[p36<=p131 | [p46<=p31 | 1<=p8]] | [p4<=p139 & ~ [1<=p84]]]]]]] & [[p68<=p112 & ~ [[p94<=p60 & ~ [p131<=p32]]]] | [~ [[~ [p118<=p9] & [p24<=p39 | p86<=p17]]] & 1<=p20]]] & [[p114<=1 & ~ [[~ [p52<=1] | [p108<=1 & p10<=0]]]] & p105<=0]]]
normalized: E [true U [[p105<=0 & [p114<=1 & ~ [[[p108<=1 & p10<=0] | ~ [p52<=1]]]]] & [[[1<=p20 & ~ [[[p24<=p39 | p86<=p17] & ~ [p118<=p9]]]] | [p68<=p112 & ~ [[p94<=p60 & ~ [p131<=p32]]]]] & [[[~ [[[p4<=p139 & ~ [1<=p84]] | [p36<=p131 | [p46<=p31 | 1<=p8]]]] & ~ [p144<=p38]] | ~ [1<=p96]] | [p60<=1 & [[[p9<=p42 | ~ [p47<=p39]] | [p130<=p146 & [p123<=p47 | [1<=p106 | p120<=p101]]]] & [[[~ [1<=p155] | [1<=p138 | 1<=p88]] & [1<=p67 & [p98<=p147 | p102<=p5]]] | ~ [[1<=p8 & [p58<=0 & 1<=p105]]]]]]]]]]

abstracting: (1<=p105)
states: 22,265,408 (7)
abstracting: (p58<=0)
states: 1,252,473,841 (9)
abstracting: (1<=p8)
states: 41,556,464 (7)
abstracting: (p102<=p5)
states: 1,169,719,132 (9)
abstracting: (p98<=p147)
states: 1,169,776,156 (9)
abstracting: (1<=p67)
states: 313,118,460 (8)
abstracting: (1<=p88)
states: 207,383,760 (8)
abstracting: (1<=p138)
states: 279,936 (5)
abstracting: (1<=p155)
states: 73,036,496 (7)
abstracting: (p120<=p101)
states: 1,191,146,700 (9)
abstracting: (1<=p106)
states: 105,151,744 (8)
abstracting: (p123<=p47)
states: 1,252,193,916 (9)
abstracting: (p130<=p146)
states: 1,252,193,916 (9)
abstracting: (p47<=p39)
states: 1,210,917,388 (9)
abstracting: (p9<=p42)
states: 1,214,066,060 (9)
abstracting: (p60<=1)
states: 1,252,473,852 (9)
abstracting: (1<=p96)
states: 2,895,696 (6)
abstracting: (p144<=p38)
states: 1,185,942,396 (9)
abstracting: (1<=p8)
states: 41,556,464 (7)
abstracting: (p46<=p31)
states: 1,214,066,060 (9)
abstracting: (p36<=p131)
states: 1,101,420,332 (9)
abstracting: (1<=p84)
states: 189,246,416 (8)
abstracting: (p4<=p139)
states: 1,171,482,300 (9)
abstracting: (p131<=p32)
states: 1,237,018,860 (9)
abstracting: (p94<=p60)
states: 1,250,302,080 (9)
abstracting: (p68<=p112)
states: 1,252,473,842 (9)
abstracting: (p118<=p9)
states: 1,187,359,932 (9)
abstracting: (p86<=p17)
states: 1,054,065,980 (9)
abstracting: (p24<=p39)
states: 1,171,911,132 (9)
abstracting: (1<=p20)
states: 19,227,088 (7)
abstracting: (p52<=1)
states: 1,252,473,852 (9)
abstracting: (p10<=0)
states: 1,210,917,388 (9)
abstracting: (p108<=1)
states: 1,252,473,852 (9)
abstracting: (p114<=1)
states: 1,252,473,852 (9)
abstracting: (p105<=0)
states: 1,230,208,444 (9)
-> the formula is TRUE

FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.715sec

totally nodes used: 80919328 (8.1e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 136764819 522352675 659117494
used/not used/entry size/cache size: 33815047 33293817 16 1024MB
basic ops cache: hits/miss/sum: 21251491 92353256 113604747
used/not used/entry size/cache size: 15094206 1683010 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 471277 1779085 2250362
used/not used/entry size/cache size: 670587 7718021 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 53803223
1 9718117
2 2686029
3 715174
4 154395
5 27139
6 4139
7 561
8 81
9 6
>= 10 0

Total processing time: 5m13.108sec


BK_STOP 1678701303573

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

25656 41727 45449 48073 50045 53156 50703 51695 52064 51830 53636 55371 57352 60161 58931 60398 59471 58052 59173 59149 56161 56965 58835 57932 56564 58433 58049 58219 57680 53080 53544 54573 54190 52911 50760 59697 68663 74142
iterations count:3877930 (11610), effective:96222 (288)

initing FirstDep: 0m 0.000sec


iterations count:6219 (18), effective:298 (0)

iterations count:16391 (49), effective:786 (2)

iterations count:14493 (43), effective:694 (2)

iterations count:15639 (46), effective:719 (2)

iterations count:14710 (44), effective:699 (2)

iterations count:23568 (70), effective:1167 (3)

iterations count:47935 (143), effective:2491 (7)

iterations count:15042 (45), effective:707 (2)

iterations count:15750 (47), effective:740 (2)

iterations count:15508 (46), effective:781 (2)

iterations count:14306 (42), effective:679 (2)

iterations count:12105 (36), effective:586 (1)

iterations count:14777 (44), effective:702 (2)

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="marciexred"
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-5348"
echo " Executing tool marciexred"
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 r202-smll-167840348500318"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;