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-167840348400234.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-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348400234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.8K Feb 26 17:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 17:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 17:59 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 46K 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-01-CTLFireability-00
FORMULA_NAME HealthRecord-PT-01-CTLFireability-01
FORMULA_NAME HealthRecord-PT-01-CTLFireability-02
FORMULA_NAME HealthRecord-PT-01-CTLFireability-03
FORMULA_NAME HealthRecord-PT-01-CTLFireability-04
FORMULA_NAME HealthRecord-PT-01-CTLFireability-05
FORMULA_NAME HealthRecord-PT-01-CTLFireability-06
FORMULA_NAME HealthRecord-PT-01-CTLFireability-07
FORMULA_NAME HealthRecord-PT-01-CTLFireability-08
FORMULA_NAME HealthRecord-PT-01-CTLFireability-09
FORMULA_NAME HealthRecord-PT-01-CTLFireability-10
FORMULA_NAME HealthRecord-PT-01-CTLFireability-11
FORMULA_NAME HealthRecord-PT-01-CTLFireability-12
FORMULA_NAME HealthRecord-PT-01-CTLFireability-13
FORMULA_NAME HealthRecord-PT-01-CTLFireability-14
FORMULA_NAME HealthRecord-PT-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678681341835

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 04:22:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 04:22:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 04:22:24] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-13 04:22:24] [INFO ] Transformed 117 places.
[2023-03-13 04:22:24] [INFO ] Transformed 218 transitions.
[2023-03-13 04:22:24] [INFO ] Found NUPN structural information;
[2023-03-13 04:22:24] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 184
Applied a total of 32 rules in 27 ms. Remains 101 /117 variables (removed 16) and now considering 184/213 (removed 29) transitions.
[2023-03-13 04:22:24] [INFO ] Flow matrix only has 179 transitions (discarded 5 similar events)
// Phase 1: matrix 179 rows 101 cols
[2023-03-13 04:22:24] [INFO ] Computed 11 place invariants in 19 ms
[2023-03-13 04:22:25] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-13 04:22:25] [INFO ] Flow matrix only has 179 transitions (discarded 5 similar events)
[2023-03-13 04:22:25] [INFO ] Invariant cache hit.
[2023-03-13 04:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:22:25] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-13 04:22:25] [INFO ] Flow matrix only has 179 transitions (discarded 5 similar events)
[2023-03-13 04:22:25] [INFO ] Invariant cache hit.
[2023-03-13 04:22:25] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/117 places, 184/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 101/117 places, 184/213 transitions.
Support contains 64 out of 101 places after structural reductions.
[2023-03-13 04:22:26] [INFO ] Flatten gal took : 75 ms
[2023-03-13 04:22:26] [INFO ] Flatten gal took : 31 ms
[2023-03-13 04:22:26] [INFO ] Input system was already deterministic with 184 transitions.
Incomplete random walk after 10000 steps, including 526 resets, run finished after 786 ms. (steps per millisecond=12 ) properties (out of 65) seen :36
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-13 04:22:27] [INFO ] Flow matrix only has 179 transitions (discarded 5 similar events)
[2023-03-13 04:22:27] [INFO ] Invariant cache hit.
[2023-03-13 04:22:27] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-13 04:22:27] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-13 04:22:27] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:23
[2023-03-13 04:22:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:22:27] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :1 sat :0 real:24
[2023-03-13 04:22:27] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:24
[2023-03-13 04:22:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-13 04:22:27] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-13 04:22:28] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :23
[2023-03-13 04:22:28] [INFO ] After 259ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :23
[2023-03-13 04:22:28] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 7 ms to minimize.
[2023-03-13 04:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-13 04:22:28] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-13 04:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-13 04:22:29] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2023-03-13 04:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-13 04:22:29] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2023-03-13 04:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-13 04:22:29] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-13 04:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-13 04:22:29] [INFO ] After 1154ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :23
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-13 04:22:29] [INFO ] After 2033ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :23
Fused 25 Parikh solutions to 22 different solutions.
Parikh walk visited 17 properties in 66 ms.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (trivial) has 126 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 336 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 93 transition count 167
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 90 transition count 163
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 89 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 88 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 16 place count 88 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 21 place count 85 transition count 159
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 54 place count 52 transition count 93
Iterating global reduction 4 with 33 rules applied. Total rules applied 87 place count 52 transition count 93
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 97 place count 42 transition count 73
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 42 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 111 place count 42 transition count 69
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 114 place count 39 transition count 60
Iterating global reduction 5 with 3 rules applied. Total rules applied 117 place count 39 transition count 60
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 120 place count 36 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 123 place count 36 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 126 place count 36 transition count 51
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 6 with 2 rules applied. Total rules applied 128 place count 35 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 129 place count 35 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 137 place count 31 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 138 place count 31 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 139 place count 31 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 140 place count 30 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 142 place count 30 transition count 60
Applied a total of 142 rules in 50 ms. Remains 30 /101 variables (removed 71) and now considering 60/184 (removed 124) transitions.
[2023-03-13 04:22:29] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 30 cols
[2023-03-13 04:22:29] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-13 04:22:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 30/101 places, 60/184 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Finished probabilistic random walk after 1879 steps, run visited all 6 properties in 38 ms. (steps per millisecond=49 )
Probabilistic random walk after 1879 steps, saw 441 distinct states, run finished after 38 ms. (steps per millisecond=49 ) properties seen :6
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA HealthRecord-PT-01-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 13 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 21 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 184 transitions.
Computed a total of 12 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 66 transition count 118
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 66 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 61 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 61 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 82 place count 61 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 59 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 59 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 57 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 57 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 57 transition count 94
Applied a total of 92 rules in 18 ms. Remains 57 /101 variables (removed 44) and now considering 94/184 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 57/101 places, 94/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 58 transition count 102
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 58 transition count 102
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 48 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 48 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 45 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 45 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 42 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 42 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 42 transition count 61
Applied a total of 124 rules in 11 ms. Remains 42 /101 variables (removed 59) and now considering 61/184 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 42/101 places, 61/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (trivial) has 132 edges and 101 vertex of which 14 / 101 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 61 transition count 115
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 61 transition count 115
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 76 place count 52 transition count 97
Iterating global reduction 0 with 9 rules applied. Total rules applied 85 place count 52 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 88 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 49 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 49 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 46 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 46 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 46 transition count 76
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 46 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 119 place count 41 transition count 65
Applied a total of 119 rules in 30 ms. Remains 41 /101 variables (removed 60) and now considering 65/184 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 41/101 places, 65/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 59 transition count 104
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 59 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 51 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 51 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 49 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 49 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 47 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 47 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 47 transition count 73
Applied a total of 113 rules in 10 ms. Remains 47 /101 variables (removed 54) and now considering 73/184 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 47/101 places, 73/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 11 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 64 transition count 114
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 64 transition count 114
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 55 transition count 96
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 55 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 55 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 54 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 53 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 53 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 53 transition count 87
Applied a total of 100 rules in 10 ms. Remains 53 /101 variables (removed 48) and now considering 87/184 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 53/101 places, 87/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (trivial) has 141 edges and 101 vertex of which 12 / 101 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 57 transition count 107
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 57 transition count 107
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 85 place count 47 transition count 87
Iterating global reduction 0 with 10 rules applied. Total rules applied 95 place count 47 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 99 place count 47 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 44 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 44 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 41 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 41 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 114 place count 41 transition count 65
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 41 transition count 59
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 2 with 4 rules applied. Total rules applied 124 place count 39 transition count 57
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 35 transition count 53
Applied a total of 128 rules in 24 ms. Remains 35 /101 variables (removed 66) and now considering 53/184 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 35/101 places, 53/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 59 transition count 104
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 59 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 51 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 51 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 49 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 49 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 47 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 47 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 47 transition count 73
Applied a total of 113 rules in 6 ms. Remains 47 /101 variables (removed 54) and now considering 73/184 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 47/101 places, 73/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 60 transition count 106
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 60 transition count 106
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 51 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 50 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 50 transition count 82
Applied a total of 105 rules in 5 ms. Remains 50 /101 variables (removed 51) and now considering 82/184 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 50/101 places, 82/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 57 transition count 100
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 57 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 47 transition count 80
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 47 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 47 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 45 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 45 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 43 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 43 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 43 transition count 64
Applied a total of 122 rules in 6 ms. Remains 43 /101 variables (removed 58) and now considering 64/184 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 43/101 places, 64/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 63 transition count 111
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 63 transition count 111
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 54 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 53 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 53 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 52 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 52 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 52 transition count 84
Applied a total of 102 rules in 7 ms. Remains 52 /101 variables (removed 49) and now considering 84/184 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 52/101 places, 84/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 57 transition count 100
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 57 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 47 transition count 80
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 47 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 47 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 44 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 44 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 42 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 42 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 42 transition count 61
Applied a total of 124 rules in 6 ms. Remains 42 /101 variables (removed 59) and now considering 61/184 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 42/101 places, 61/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (trivial) has 110 edges and 101 vertex of which 12 / 101 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 65 transition count 120
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 65 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 67 place count 59 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 73 place count 59 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 75 place count 59 transition count 106
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 59 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 54 transition count 96
Applied a total of 90 rules in 18 ms. Remains 54 /101 variables (removed 47) and now considering 96/184 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 54/101 places, 96/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 61 transition count 108
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 61 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 54 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 96 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 53 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 52 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 52 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 52 transition count 86
Applied a total of 101 rules in 6 ms. Remains 52 /101 variables (removed 49) and now considering 86/184 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 52/101 places, 86/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 63 transition count 111
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 63 transition count 111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 55 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 54 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 54 transition count 89
Applied a total of 97 rules in 4 ms. Remains 54 /101 variables (removed 47) and now considering 89/184 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/101 places, 89/184 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:22:31] [INFO ] Input system was already deterministic with 89 transitions.
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 10 ms
[2023-03-13 04:22:31] [INFO ] Flatten gal took : 9 ms
[2023-03-13 04:22:31] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 04:22:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 184 transitions and 480 arcs took 1 ms.
Total runtime 7340 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 101 NrTr: 184 NrArc: 480)

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

net check time: 0m 0.000sec

init dd package: 0m 3.369sec


RS generation: 0m 0.378sec


-> reachability set: #nodes 4840 (4.8e+03) #states 1,300,492 (6)



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

checking: EG [EF [AG [[p54<=0 & 0<=p54]]]]
normalized: EG [E [true U ~ [E [true U ~ [[p54<=0 & 0<=p54]]]]]]

abstracting: (0<=p54)
states: 1,300,492 (6)
abstracting: (p54<=0)
states: 1,300,491 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA HealthRecord-PT-01-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.973sec

checking: EX [EF [AG [[p77<=1 & 1<=p77]]]]
normalized: EX [E [true U ~ [E [true U ~ [[p77<=1 & 1<=p77]]]]]]

abstracting: (1<=p77)
states: 13,824 (4)
abstracting: (p77<=1)
states: 1,300,492 (6)
.-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AX [AG [EX [[[p57<=0 & 0<=p57] | [p74<=0 & 0<=p74]]]]]
normalized: ~ [EX [E [true U ~ [EX [[[p74<=0 & 0<=p74] | [p57<=0 & 0<=p57]]]]]]]

abstracting: (0<=p57)
states: 1,300,492 (6)
abstracting: (p57<=0)
states: 1,075,980 (6)
abstracting: (0<=p74)
states: 1,300,492 (6)
abstracting: (p74<=0)
states: 1,246,732 (6)
..-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.524sec

checking: AX [EF [~ [E [~ [[[p36<=1 & 1<=p36] & [p98<=1 & 1<=p98]]] U ~ [EF [[p10<=1 & 1<=p10]]]]]]]
normalized: ~ [EX [~ [E [true U ~ [E [~ [[[p98<=1 & 1<=p98] & [p36<=1 & 1<=p36]]] U ~ [E [true U [p10<=1 & 1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 62,464 (4)
abstracting: (p10<=1)
states: 1,300,492 (6)
abstracting: (1<=p36)
states: 279,296 (5)
abstracting: (p36<=1)
states: 1,300,492 (6)
abstracting: (1<=p98)
states: 96,512 (4)
abstracting: (p98<=1)
states: 1,300,492 (6)
.-> the formula is TRUE

FORMULA HealthRecord-PT-01-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.732sec

checking: E [[p40<=1 & 1<=p40] U AX [~ [AG [[~ [[[p57<=1 & 1<=p57] & [p80<=1 & 1<=p80]]] & ~ [[p9<=1 & 1<=p9]]]]]]]
normalized: E [[p40<=1 & 1<=p40] U ~ [EX [~ [E [true U ~ [[~ [[p9<=1 & 1<=p9]] & ~ [[[p80<=1 & 1<=p80] & [p57<=1 & 1<=p57]]]]]]]]]]

abstracting: (1<=p57)
states: 224,512 (5)
abstracting: (p57<=1)
states: 1,300,492 (6)
abstracting: (1<=p80)
states: 13,824 (4)
abstracting: (p80<=1)
states: 1,300,492 (6)
abstracting: (1<=p9)
states: 38,912 (4)
abstracting: (p9<=1)
states: 1,300,492 (6)
.abstracting: (1<=p40)
states: 71,424 (4)
abstracting: (p40<=1)
states: 1,300,492 (6)
-> the formula is TRUE

FORMULA HealthRecord-PT-01-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.177sec

checking: AX [AG [[[p79<=0 & 0<=p79] | [E [[p44<=1 & 1<=p44] U [p2<=1 & 1<=p2]] & EG [[p65<=1 & 1<=p65]]]]]]
normalized: ~ [EX [E [true U ~ [[[E [[p44<=1 & 1<=p44] U [p2<=1 & 1<=p2]] & EG [[p65<=1 & 1<=p65]]] | [p79<=0 & 0<=p79]]]]]]

abstracting: (0<=p79)
states: 1,300,492 (6)
abstracting: (p79<=0)
states: 1,286,668 (6)
abstracting: (1<=p65)
states: 13,824 (4)
abstracting: (p65<=1)
states: 1,300,492 (6)
....
EG iterations: 4
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p44)
states: 71,424 (4)
abstracting: (p44<=1)
states: 1,300,492 (6)
.-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.137sec

checking: AG [[EF [[[p48<=0 & 0<=p48] | [[p5<=1 & 1<=p5] | [p96<=1 & 1<=p96]]]] | [EF [[[p19<=1 & 1<=p19] & [p87<=1 & 1<=p87]]] & [p4<=0 & 0<=p4]]]]
normalized: ~ [E [true U ~ [[[[p4<=0 & 0<=p4] & E [true U [[p87<=1 & 1<=p87] & [p19<=1 & 1<=p19]]]] | E [true U [[[p96<=1 & 1<=p96] | [p5<=1 & 1<=p5]] | [p48<=0 & 0<=p48]]]]]]]

abstracting: (0<=p48)
states: 1,300,492 (6)
abstracting: (p48<=0)
states: 1,249,036 (6)
abstracting: (1<=p5)
states: 62,464 (4)
abstracting: (p5<=1)
states: 1,300,492 (6)
abstracting: (1<=p96)
states: 29,952 (4)
abstracting: (p96<=1)
states: 1,300,492 (6)
abstracting: (1<=p19)
states: 325,120 (5)
abstracting: (p19<=1)
states: 1,300,492 (6)
abstracting: (1<=p87)
states: 6,912 (3)
abstracting: (p87<=1)
states: 1,300,492 (6)
abstracting: (0<=p4)
states: 1,300,492 (6)
abstracting: (p4<=0)
states: 1,238,028 (6)
-> the formula is TRUE

FORMULA HealthRecord-PT-01-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: AG [~ [A [AX [A [[[p57<=1 & 1<=p57] & [p74<=1 & 1<=p74]] U [p41<=1 & 1<=p41]]] U A [[EF [[p11<=1 & 1<=p11]] & [p69<=1 & 1<=p69]] U EX [[p6<=1 & 1<=p6]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[~ [EG [~ [EX [[p6<=1 & 1<=p6]]]]] & ~ [E [~ [EX [[p6<=1 & 1<=p6]]] U [~ [[[p69<=1 & 1<=p69] & E [true U [p11<=1 & 1<=p11]]]] & ~ [EX [[p6<=1 & 1<=p6]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EX [[p6<=1 & 1<=p6]]]]] & ~ [E [~ [EX [[p6<=1 & 1<=p6]]] U [~ [[[p69<=1 & 1<=p69] & E [true U [p11<=1 & 1<=p11]]]] & ~ [EX [[p6<=1 & 1<=p6]]]]]]]] U [EX [~ [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [~ [[[p74<=1 & 1<=p74] & [p57<=1 & 1<=p57]]] & ~ [[p41<=1 & 1<=p41]]]]]]]] & ~ [[~ [EG [~ [EX [[p6<=1 & 1<=p6]]]]] & ~ [E [~ [EX [[p6<=1 & 1<=p6]]] U [~ [[[p69<=1 & 1<=p69] & E [true U [p11<=1 & 1<=p11]]]] & ~ [EX [[p6<=1 & 1<=p6]]]]]]]]]]]]]]

abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
.abstracting: (1<=p11)
states: 62,464 (4)
abstracting: (p11<=1)
states: 1,300,492 (6)
abstracting: (1<=p69)
states: 13,824 (4)
abstracting: (p69<=1)
states: 1,300,492 (6)
abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
.abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
..
EG iterations: 1
abstracting: (1<=p41)
states: 71,424 (4)
abstracting: (p41<=1)
states: 1,300,492 (6)
abstracting: (1<=p57)
states: 224,512 (5)
abstracting: (p57<=1)
states: 1,300,492 (6)
abstracting: (1<=p74)
states: 53,760 (4)
abstracting: (p74<=1)
states: 1,300,492 (6)
abstracting: (1<=p41)
states: 71,424 (4)
abstracting: (p41<=1)
states: 1,300,492 (6)
abstracting: (1<=p41)
states: 71,424 (4)
abstracting: (p41<=1)
states: 1,300,492 (6)
.
EG iterations: 1
.abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
.abstracting: (1<=p11)
states: 62,464 (4)
abstracting: (p11<=1)
states: 1,300,492 (6)
abstracting: (1<=p69)
states: 13,824 (4)
abstracting: (p69<=1)
states: 1,300,492 (6)
abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
.abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
..
EG iterations: 1
abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
.abstracting: (1<=p11)
states: 62,464 (4)
abstracting: (p11<=1)
states: 1,300,492 (6)
abstracting: (1<=p69)
states: 13,824 (4)
abstracting: (p69<=1)
states: 1,300,492 (6)
abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
.abstracting: (1<=p6)
states: 38,912 (4)
abstracting: (p6<=1)
states: 1,300,492 (6)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.274sec

checking: E [~ [EF [[p88<=1 & 1<=p88]]] U [AF [[p45<=1 & 1<=p45]] & [EX [0<=0] & [E [[EG [[p19<=1 & 1<=p19]] & [p93<=1 & 1<=p93]] U ~ [AX [[p19<=1 & 1<=p19]]]] | ~ [AG [[[p66<=1 & 1<=p66] | [p12<=1 & 1<=p12]]]]]]]]
normalized: E [~ [E [true U [p88<=1 & 1<=p88]]] U [[[E [true U ~ [[[p12<=1 & 1<=p12] | [p66<=1 & 1<=p66]]]] | E [[[p93<=1 & 1<=p93] & EG [[p19<=1 & 1<=p19]]] U EX [~ [[p19<=1 & 1<=p19]]]]] & EX [0<=0]] & ~ [EG [~ [[p45<=1 & 1<=p45]]]]]]

abstracting: (1<=p45)
states: 72,960 (4)
abstracting: (p45<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (0<=0)
states: 1,300,492 (6)
.abstracting: (1<=p19)
states: 325,120 (5)
abstracting: (p19<=1)
states: 1,300,492 (6)
.abstracting: (1<=p19)
states: 325,120 (5)
abstracting: (p19<=1)
states: 1,300,492 (6)
.......
EG iterations: 7
abstracting: (1<=p93)
states: 6,912 (3)
abstracting: (p93<=1)
states: 1,300,492 (6)
abstracting: (1<=p66)
states: 53,760 (4)
abstracting: (p66<=1)
states: 1,300,492 (6)
abstracting: (1<=p12)
states: 319,744 (5)
abstracting: (p12<=1)
states: 1,300,492 (6)
abstracting: (1<=p88)
states: 29,952 (4)
abstracting: (p88<=1)
states: 1,300,492 (6)
-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.777sec

checking: AG [[[EX [[[p93<=1 & 1<=p93] | [p35<=1 & 1<=p35]]] | [p95<=1 & 1<=p95]] | [[p87<=1 & 1<=p87] | [[AF [[p34<=1 & 1<=p34]] & [[p2<=0 & 0<=p2] & [p47<=0 & 0<=p47]]] | [EF [[p8<=0 & 0<=p8]] & [p45<=0 & 0<=p45]]]]]]
normalized: ~ [E [true U ~ [[[[[[p45<=0 & 0<=p45] & E [true U [p8<=0 & 0<=p8]]] | [[[p47<=0 & 0<=p47] & [p2<=0 & 0<=p2]] & ~ [EG [~ [[p34<=1 & 1<=p34]]]]]] | [p87<=1 & 1<=p87]] | [[p95<=1 & 1<=p95] | EX [[[p35<=1 & 1<=p35] | [p93<=1 & 1<=p93]]]]]]]]

abstracting: (1<=p93)
states: 6,912 (3)
abstracting: (p93<=1)
states: 1,300,492 (6)
abstracting: (1<=p35)
states: 204,288 (5)
abstracting: (p35<=1)
states: 1,300,492 (6)
.abstracting: (1<=p95)
states: 56,064 (4)
abstracting: (p95<=1)
states: 1,300,492 (6)
abstracting: (1<=p87)
states: 6,912 (3)
abstracting: (p87<=1)
states: 1,300,492 (6)
abstracting: (1<=p34)
states: 192,256 (5)
abstracting: (p34<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (0<=p2)
states: 1,300,492 (6)
abstracting: (p2<=0)
states: 1,238,028 (6)
abstracting: (0<=p47)
states: 1,300,492 (6)
abstracting: (p47<=0)
states: 1,222,924 (6)
abstracting: (0<=p8)
states: 1,300,492 (6)
abstracting: (p8<=0)
states: 1,261,580 (6)
abstracting: (0<=p45)
states: 1,300,492 (6)
abstracting: (p45<=0)
states: 1,227,532 (6)
-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.224sec

checking: E [~ [[p55<=1 & 1<=p55]] U A [EF [[AF [[p34<=1 & 1<=p34]] & [~ [[p87<=1 & 1<=p87]] | [[p49<=1 & 1<=p49] & [p51<=1 & 1<=p51]]]]] U AF [[A [[p60<=1 & 1<=p60] U [p2<=1 & 1<=p2]] | [EX [[p76<=1 & 1<=p76]] & ~ [[[p12<=1 & 1<=p12] & [p69<=1 & 1<=p69]]]]]]]]
normalized: E [~ [[p55<=1 & 1<=p55]] U [~ [EG [EG [~ [[[EX [[p76<=1 & 1<=p76]] & ~ [[[p69<=1 & 1<=p69] & [p12<=1 & 1<=p12]]]] | [~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [[p2<=1 & 1<=p2]] & ~ [[p60<=1 & 1<=p60]]]]]]]]]]] & ~ [E [EG [~ [[[EX [[p76<=1 & 1<=p76]] & ~ [[[p69<=1 & 1<=p69] & [p12<=1 & 1<=p12]]]] | [~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [[p2<=1 & 1<=p2]] & ~ [[p60<=1 & 1<=p60]]]]]]]]] U [~ [E [true U [[~ [[p87<=1 & 1<=p87]] | [[p51<=1 & 1<=p51] & [p49<=1 & 1<=p49]]] & ~ [EG [~ [[p34<=1 & 1<=p34]]]]]]] & EG [~ [[[EX [[p76<=1 & 1<=p76]] & ~ [[[p69<=1 & 1<=p69] & [p12<=1 & 1<=p12]]]] | [~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [[p2<=1 & 1<=p2]] & ~ [[p60<=1 & 1<=p60]]]]]]]]]]]]]]

abstracting: (1<=p60)
states: 7
abstracting: (p60<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 319,744 (5)
abstracting: (p12<=1)
states: 1,300,492 (6)
abstracting: (1<=p69)
states: 13,824 (4)
abstracting: (p69<=1)
states: 1,300,492 (6)
abstracting: (1<=p76)
states: 13,824 (4)
abstracting: (p76<=1)
states: 1,300,492 (6)
..
EG iterations: 1
abstracting: (1<=p34)
states: 192,256 (5)
abstracting: (p34<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (1<=p49)
states: 53,760 (4)
abstracting: (p49<=1)
states: 1,300,492 (6)
abstracting: (1<=p51)
states: 1
abstracting: (p51<=1)
states: 1,300,492 (6)
abstracting: (1<=p87)
states: 6,912 (3)
abstracting: (p87<=1)
states: 1,300,492 (6)
abstracting: (1<=p60)
states: 7
abstracting: (p60<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 319,744 (5)
abstracting: (p12<=1)
states: 1,300,492 (6)
abstracting: (1<=p69)
states: 13,824 (4)
abstracting: (p69<=1)
states: 1,300,492 (6)
abstracting: (1<=p76)
states: 13,824 (4)
abstracting: (p76<=1)
states: 1,300,492 (6)
..
EG iterations: 1
abstracting: (1<=p60)
states: 7
abstracting: (p60<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
abstracting: (1<=p2)
states: 62,464 (4)
abstracting: (p2<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 319,744 (5)
abstracting: (p12<=1)
states: 1,300,492 (6)
abstracting: (1<=p69)
states: 13,824 (4)
abstracting: (p69<=1)
states: 1,300,492 (6)
abstracting: (1<=p76)
states: 13,824 (4)
abstracting: (p76<=1)
states: 1,300,492 (6)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p55)
states: 1
abstracting: (p55<=1)
states: 1,300,492 (6)
-> the formula is TRUE

FORMULA HealthRecord-PT-01-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.595sec

checking: E [EF [[[[p93<=1 & 1<=p93] & [p21<=1 & 1<=p21]] & [[[p79<=1 & 1<=p79] | [[p5<=1 & 1<=p5] | [AF [[p77<=1 & 1<=p77]] & EF [[p71<=1 & 1<=p71]]]]] & [EF [[[p57<=1 & 1<=p57] & [p76<=1 & 1<=p76]]] | [[p59<=1 & 1<=p59] | [p15<=1 & 1<=p15]]]]]] U E [[[p32<=1 & 1<=p32] | EG [[EG [[p85<=1 & 1<=p85]] | [p43<=1 & 1<=p43]]]] U EG [[p3<=1 & 1<=p3]]]]
normalized: E [E [true U [[[[[p15<=1 & 1<=p15] | [p59<=1 & 1<=p59]] | E [true U [[p76<=1 & 1<=p76] & [p57<=1 & 1<=p57]]]] & [[[E [true U [p71<=1 & 1<=p71]] & ~ [EG [~ [[p77<=1 & 1<=p77]]]]] | [p5<=1 & 1<=p5]] | [p79<=1 & 1<=p79]]] & [[p21<=1 & 1<=p21] & [p93<=1 & 1<=p93]]]] U E [[EG [[[p43<=1 & 1<=p43] | EG [[p85<=1 & 1<=p85]]]] | [p32<=1 & 1<=p32]] U EG [[p3<=1 & 1<=p3]]]]

abstracting: (1<=p3)
states: 62,464 (4)
abstracting: (p3<=1)
states: 1,300,492 (6)
.......
EG iterations: 7
abstracting: (1<=p32)
states: 11
abstracting: (p32<=1)
states: 1,300,492 (6)
abstracting: (1<=p85)
states: 13,824 (4)
abstracting: (p85<=1)
states: 1,300,492 (6)
....
EG iterations: 4
abstracting: (1<=p43)
states: 71,424 (4)
abstracting: (p43<=1)
states: 1,300,492 (6)
.......
EG iterations: 7
abstracting: (1<=p93)
states: 6,912 (3)
abstracting: (p93<=1)
states: 1,300,492 (6)
abstracting: (1<=p21)
states: 325,120 (5)
abstracting: (p21<=1)
states: 1,300,492 (6)
abstracting: (1<=p79)
states: 13,824 (4)
abstracting: (p79<=1)
states: 1,300,492 (6)
abstracting: (1<=p5)
states: 62,464 (4)
abstracting: (p5<=1)
states: 1,300,492 (6)
abstracting: (1<=p77)
states: 13,824 (4)
abstracting: (p77<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (1<=p71)
states: 13,824 (4)
abstracting: (p71<=1)
states: 1,300,492 (6)
abstracting: (1<=p57)
states: 224,512 (5)
abstracting: (p57<=1)
states: 1,300,492 (6)
abstracting: (1<=p76)
states: 13,824 (4)
abstracting: (p76<=1)
states: 1,300,492 (6)
abstracting: (1<=p59)
states: 9,984 (3)
abstracting: (p59<=1)
states: 1,300,492 (6)
abstracting: (1<=p15)
states: 11
abstracting: (p15<=1)
states: 1,300,492 (6)
-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.303sec

checking: EG [[A [AG [[p39<=1 & 1<=p39]] U EX [[[p9<=1 & 1<=p9] | [p90<=1 & 1<=p90]]]] | [[p77<=1 & 1<=p77] | [[AG [[p24<=0 & 0<=p24]] & [~ [A [[[p57<=1 & 1<=p57] & [p80<=1 & 1<=p80]] U [p61<=1 & 1<=p61]]] | [[p12<=0 & 0<=p12] | [p98<=0 & 0<=p98]]]] & [[[p36<=0 & 0<=p36] | [p98<=0 & 0<=p98]] & [[p55<=1 & 1<=p55] | [[p90<=1 & 1<=p90] & [[p70<=1 & 1<=p70] | [p20<=1 & 1<=p20]]]]]]]]]
normalized: EG [[[[[[[[[p20<=1 & 1<=p20] | [p70<=1 & 1<=p70]] & [p90<=1 & 1<=p90]] | [p55<=1 & 1<=p55]] & [[p98<=0 & 0<=p98] | [p36<=0 & 0<=p36]]] & [[[[p98<=0 & 0<=p98] | [p12<=0 & 0<=p12]] | ~ [[~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[[p80<=1 & 1<=p80] & [p57<=1 & 1<=p57]]] & ~ [[p61<=1 & 1<=p61]]]]]]]] & ~ [E [true U ~ [[p24<=0 & 0<=p24]]]]]] | [p77<=1 & 1<=p77]] | [~ [EG [~ [EX [[[p90<=1 & 1<=p90] | [p9<=1 & 1<=p9]]]]]] & ~ [E [~ [EX [[[p90<=1 & 1<=p90] | [p9<=1 & 1<=p9]]]] U [E [true U ~ [[p39<=1 & 1<=p39]]] & ~ [EX [[[p90<=1 & 1<=p90] | [p9<=1 & 1<=p9]]]]]]]]]]

abstracting: (1<=p9)
states: 38,912 (4)
abstracting: (p9<=1)
states: 1,300,492 (6)
abstracting: (1<=p90)
states: 1
abstracting: (p90<=1)
states: 1,300,492 (6)
.abstracting: (1<=p39)
states: 4
abstracting: (p39<=1)
states: 1,300,492 (6)
abstracting: (1<=p9)
states: 38,912 (4)
abstracting: (p9<=1)
states: 1,300,492 (6)
abstracting: (1<=p90)
states: 1
abstracting: (p90<=1)
states: 1,300,492 (6)
.abstracting: (1<=p9)
states: 38,912 (4)
abstracting: (p9<=1)
states: 1,300,492 (6)
abstracting: (1<=p90)
states: 1
abstracting: (p90<=1)
states: 1,300,492 (6)
..
EG iterations: 1
abstracting: (1<=p77)
states: 13,824 (4)
abstracting: (p77<=1)
states: 1,300,492 (6)
abstracting: (0<=p24)
states: 1,300,492 (6)
abstracting: (p24<=0)
states: 975,372 (5)
abstracting: (1<=p61)
states: 13,824 (4)
abstracting: (p61<=1)
states: 1,300,492 (6)
abstracting: (1<=p57)
states: 224,512 (5)
abstracting: (p57<=1)
states: 1,300,492 (6)
abstracting: (1<=p80)
states: 13,824 (4)
abstracting: (p80<=1)
states: 1,300,492 (6)
abstracting: (1<=p61)
states: 13,824 (4)
abstracting: (p61<=1)
states: 1,300,492 (6)
abstracting: (1<=p61)
states: 13,824 (4)
abstracting: (p61<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (0<=p12)
states: 1,300,492 (6)
abstracting: (p12<=0)
states: 980,748 (5)
abstracting: (0<=p98)
states: 1,300,492 (6)
abstracting: (p98<=0)
states: 1,203,980 (6)
abstracting: (0<=p36)
states: 1,300,492 (6)
abstracting: (p36<=0)
states: 1,021,196 (6)
abstracting: (0<=p98)
states: 1,300,492 (6)
abstracting: (p98<=0)
states: 1,203,980 (6)
abstracting: (1<=p55)
states: 1
abstracting: (p55<=1)
states: 1,300,492 (6)
abstracting: (1<=p90)
states: 1
abstracting: (p90<=1)
states: 1,300,492 (6)
abstracting: (1<=p70)
states: 53,760 (4)
abstracting: (p70<=1)
states: 1,300,492 (6)
abstracting: (1<=p20)
states: 325,120 (5)
abstracting: (p20<=1)
states: 1,300,492 (6)
......
EG iterations: 6
-> the formula is FALSE

FORMULA HealthRecord-PT-01-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.312sec

checking: [~ [E [EX [[EF [[1<=p91 & p91<=1]] | [[p54<=1 & 1<=p54] | EF [[p16<=1 & 1<=p16]]]]] U [[AF [[AF [[[p57<=1 & 1<=p57] & [p66<=1 & 1<=p66]]] | AF [[p85<=1 & 1<=p85]]]] & EG [[p83<=1 & 1<=p83]]] & [AG [[p21<=1 & 1<=p21]] & [~ [[p80<=1 & 1<=p80]] | [[p54<=1 & 1<=p54] | [p50<=1 & 1<=p50]]]]]]] | EF [[[AX [[p79<=1 & 1<=p79]] & [[p12<=0 & 0<=p12] | [p98<=0 & 0<=p98]]] & [[[p4<=0 & 0<=p4] | [p59<=0 & 0<=p59]] & [p46<=0 & 0<=p46]]]]]
normalized: [E [true U [[[p46<=0 & 0<=p46] & [[p59<=0 & 0<=p59] | [p4<=0 & 0<=p4]]] & [[[p98<=0 & 0<=p98] | [p12<=0 & 0<=p12]] & ~ [EX [~ [[p79<=1 & 1<=p79]]]]]]] | ~ [E [EX [[[E [true U [p16<=1 & 1<=p16]] | [p54<=1 & 1<=p54]] | E [true U [1<=p91 & p91<=1]]]] U [[[[[p50<=1 & 1<=p50] | [p54<=1 & 1<=p54]] | ~ [[p80<=1 & 1<=p80]]] & ~ [E [true U ~ [[p21<=1 & 1<=p21]]]]] & [EG [[p83<=1 & 1<=p83]] & ~ [EG [~ [[~ [EG [~ [[p85<=1 & 1<=p85]]]] | ~ [EG [~ [[[p66<=1 & 1<=p66] & [p57<=1 & 1<=p57]]]]]]]]]]]]]]

abstracting: (1<=p57)
states: 224,512 (5)
abstracting: (p57<=1)
states: 1,300,492 (6)
abstracting: (1<=p66)
states: 53,760 (4)
abstracting: (p66<=1)
states: 1,300,492 (6)
.
EG iterations: 1
abstracting: (1<=p85)
states: 13,824 (4)
abstracting: (p85<=1)
states: 1,300,492 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p83)
states: 9,216 (3)
abstracting: (p83<=1)
states: 1,300,492 (6)
....
EG iterations: 4
abstracting: (1<=p21)
states: 325,120 (5)
abstracting: (p21<=1)
states: 1,300,492 (6)
abstracting: (1<=p80)
states: 13,824 (4)
abstracting: (p80<=1)
states: 1,300,492 (6)
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,300,492 (6)
abstracting: (1<=p50)
states: 89,600 (4)
abstracting: (p50<=1)
states: 1,300,492 (6)
abstracting: (p91<=1)
states: 1,300,492 (6)
abstracting: (1<=p91)
states: 1
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,300,492 (6)
abstracting: (1<=p16)
states: 325,120 (5)
abstracting: (p16<=1)
states: 1,300,492 (6)
.abstracting: (1<=p79)
states: 13,824 (4)
abstracting: (p79<=1)
states: 1,300,492 (6)
.abstracting: (0<=p12)
states: 1,300,492 (6)
abstracting: (p12<=0)
states: 980,748 (5)
abstracting: (0<=p98)
states: 1,300,492 (6)
abstracting: (p98<=0)
states: 1,203,980 (6)
abstracting: (0<=p4)
states: 1,300,492 (6)
abstracting: (p4<=0)
states: 1,238,028 (6)
abstracting: (0<=p59)
states: 1,300,492 (6)
abstracting: (p59<=0)
states: 1,290,508 (6)
abstracting: (0<=p46)
states: 1,300,492 (6)
abstracting: (p46<=0)
states: 1,227,532 (6)
-> the formula is TRUE

FORMULA HealthRecord-PT-01-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.350sec

totally nodes used: 3093115 (3.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2733425 10634685 13368110
used/not used/entry size/cache size: 12644417 54464447 16 1024MB
basic ops cache: hits/miss/sum: 841244 2630718 3471962
used/not used/entry size/cache size: 4225601 12551615 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: 9472 38033 47505
used/not used/entry size/cache size: 37976 8350632 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 64437594
1 2315027
2 298586
3 50467
4 6486
5 655
6 48
7 0
8 1
9 0
>= 10 0

Total processing time: 0m11.324sec


BK_STOP 1678681364185

--------------------
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 CTLFireability -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.000sec


iterations count:14367 (78), effective:654 (3)

initing FirstDep: 0m 0.000sec


iterations count:10146 (55), effective:482 (2)

iterations count:4244 (23), effective:223 (1)

iterations count:197 (1), effective:1 (0)

iterations count:7911 (42), effective:355 (1)

iterations count:2267 (12), effective:113 (0)

iterations count:4953 (26), effective:203 (1)

iterations count:2032 (11), effective:105 (0)

iterations count:2363 (12), effective:118 (0)

iterations count:1914 (10), effective:28 (0)

iterations count:281 (1), effective:3 (0)

iterations count:2371 (12), effective:121 (0)

iterations count:299 (1), effective:3 (0)

iterations count:2300 (12), effective:114 (0)

iterations count:2270 (12), effective:113 (0)

iterations count:214 (1), effective:2 (0)

iterations count:212 (1), effective:1 (0)

iterations count:2270 (12), effective:113 (0)

iterations count:214 (1), effective:2 (0)

iterations count:184 (1), effective:0 (0)

iterations count:2270 (12), effective:113 (0)

iterations count:214 (1), effective:2 (0)

iterations count:2336 (12), effective:119 (0)

iterations count:184 (1), effective:0 (0)

iterations count:1724 (9), effective:80 (0)

iterations count:2084 (11), effective:101 (0)

iterations count:2247 (12), effective:107 (0)

iterations count:190 (1), effective:1 (0)

iterations count:2535 (13), effective:126 (0)

iterations count:184 (1), effective:0 (0)

iterations count:2059 (11), effective:105 (0)

iterations count:184 (1), effective:0 (0)

iterations count:1971 (10), effective:95 (0)

iterations count:184 (1), effective:0 (0)

iterations count:2239 (12), effective:111 (0)

iterations count:302 (1), effective:3 (0)

iterations count:2350 (12), effective:119 (0)

iterations count:2397 (13), effective:121 (0)

iterations count:184 (1), effective:0 (0)

iterations count:184 (1), effective:0 (0)

iterations count:184 (1), effective:0 (0)

iterations count:196 (1), effective:3 (0)

iterations count:219 (1), effective:1 (0)

iterations count:187 (1), effective:1 (0)

iterations count:2894 (15), effective:146 (0)

iterations count:190 (1), effective:3 (0)

iterations count:7911 (42), effective:355 (1)

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-01"
export BK_EXAMINATION="CTLFireability"
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-01, examination is CTLFireability"
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-167840348400234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;