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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 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.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 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 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 71K 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-12-CTLFireability-00
FORMULA_NAME HealthRecord-PT-12-CTLFireability-01
FORMULA_NAME HealthRecord-PT-12-CTLFireability-02
FORMULA_NAME HealthRecord-PT-12-CTLFireability-03
FORMULA_NAME HealthRecord-PT-12-CTLFireability-04
FORMULA_NAME HealthRecord-PT-12-CTLFireability-05
FORMULA_NAME HealthRecord-PT-12-CTLFireability-06
FORMULA_NAME HealthRecord-PT-12-CTLFireability-07
FORMULA_NAME HealthRecord-PT-12-CTLFireability-08
FORMULA_NAME HealthRecord-PT-12-CTLFireability-09
FORMULA_NAME HealthRecord-PT-12-CTLFireability-10
FORMULA_NAME HealthRecord-PT-12-CTLFireability-11
FORMULA_NAME HealthRecord-PT-12-CTLFireability-12
FORMULA_NAME HealthRecord-PT-12-CTLFireability-13
FORMULA_NAME HealthRecord-PT-12-CTLFireability-14
FORMULA_NAME HealthRecord-PT-12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678701428529

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-12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:57:11] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-13 09:57:11] [INFO ] Transformed 160 places.
[2023-03-13 09:57:11] [INFO ] Transformed 340 transitions.
[2023-03-13 09:57:11] [INFO ] Found NUPN structural information;
[2023-03-13 09:57:11] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 82 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 113 transition count 226
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 113 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 112 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 112 transition count 224
Applied a total of 96 rules in 34 ms. Remains 112 /160 variables (removed 48) and now considering 224/312 (removed 88) transitions.
[2023-03-13 09:57:11] [INFO ] Flow matrix only has 220 transitions (discarded 4 similar events)
// Phase 1: matrix 220 rows 112 cols
[2023-03-13 09:57:11] [INFO ] Computed 10 place invariants in 22 ms
[2023-03-13 09:57:11] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-13 09:57:11] [INFO ] Flow matrix only has 220 transitions (discarded 4 similar events)
[2023-03-13 09:57:11] [INFO ] Invariant cache hit.
[2023-03-13 09:57:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:57:12] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-13 09:57:12] [INFO ] Flow matrix only has 220 transitions (discarded 4 similar events)
[2023-03-13 09:57:12] [INFO ] Invariant cache hit.
[2023-03-13 09:57:12] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/160 places, 224/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 112/160 places, 224/312 transitions.
Support contains 82 out of 112 places after structural reductions.
[2023-03-13 09:57:12] [INFO ] Flatten gal took : 66 ms
[2023-03-13 09:57:12] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:57:12] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 81 out of 112 places (down from 82) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 728 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 67) seen :36
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) 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 31) 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 31) seen :0
Running SMT prover for 31 properties.
[2023-03-13 09:57:13] [INFO ] Flow matrix only has 220 transitions (discarded 4 similar events)
[2023-03-13 09:57:13] [INFO ] Invariant cache hit.
[2023-03-13 09:57:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 09:57:13] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-13 09:57:14] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-13 09:57:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 09:57:14] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-13 09:57:14] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :30
[2023-03-13 09:57:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:57:15] [INFO ] After 355ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :30
[2023-03-13 09:57:15] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 9 ms to minimize.
[2023-03-13 09:57:15] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2023-03-13 09:57:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-13 09:57:15] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2023-03-13 09:57:15] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2023-03-13 09:57:15] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2023-03-13 09:57:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2023-03-13 09:57:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2023-03-13 09:57:16] [INFO ] After 1943ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :29
Attempting to minimize the solution found.
Minimization took 486 ms.
[2023-03-13 09:57:17] [INFO ] After 3337ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :29
Fused 31 Parikh solutions to 28 different solutions.
Parikh walk visited 4 properties in 175 ms.
Support contains 49 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 224/224 transitions.
Graph (trivial) has 38 edges and 112 vertex of which 6 / 112 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 453 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 107 transition count 212
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 106 transition count 211
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 28 place count 83 transition count 165
Iterating global reduction 2 with 23 rules applied. Total rules applied 51 place count 83 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 83 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 81 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 81 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 81 transition count 158
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 81 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 81 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 80 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 62 place count 80 transition count 154
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 64 place count 79 transition count 154
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 67 place count 79 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 70 place count 76 transition count 151
Applied a total of 70 rules in 75 ms. Remains 76 /112 variables (removed 36) and now considering 151/224 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 76/112 places, 151/224 transitions.
Incomplete random walk after 10000 steps, including 862 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Finished probabilistic random walk after 572026 steps, run visited all 24 properties in 1819 ms. (steps per millisecond=314 )
Probabilistic random walk after 572026 steps, saw 75146 distinct states, run finished after 1820 ms. (steps per millisecond=314 ) properties seen :24
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:57:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 19 ms
FORMULA HealthRecord-PT-12-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 224 transitions.
Computed a total of 10 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Graph (trivial) has 135 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 65 transition count 136
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 65 transition count 136
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 65 transition count 133
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 61 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 61 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 61 transition count 120
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 61 transition count 116
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 109 place count 59 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 58 transition count 113
Applied a total of 110 rules in 40 ms. Remains 58 /112 variables (removed 54) and now considering 113/224 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 58/112 places, 113/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 66 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 66 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 66 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 62 transition count 123
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 62 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 108 place count 62 transition count 117
Applied a total of 108 rules in 9 ms. Remains 62 /112 variables (removed 50) and now considering 117/224 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 62/112 places, 117/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 127
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 63 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 56 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 56 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 56 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 53 transition count 96
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 53 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 50 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 50 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 141 place count 50 transition count 81
Applied a total of 141 rules in 15 ms. Remains 50 /112 variables (removed 62) and now considering 81/224 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 50/112 places, 81/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Graph (trivial) has 155 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 60 transition count 125
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 60 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 100 place count 60 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 53 transition count 108
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 53 transition count 108
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 119 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 50 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 50 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 47 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 47 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 140 place count 47 transition count 79
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 47 transition count 75
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 3 with 4 rules applied. Total rules applied 148 place count 45 transition count 73
Applied a total of 148 rules in 34 ms. Remains 45 /112 variables (removed 67) and now considering 73/224 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 45/112 places, 73/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 69 transition count 137
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 63 transition count 125
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 63 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 63 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 61 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 61 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 59 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 59 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 59 transition count 104
Applied a total of 119 rules in 13 ms. Remains 59 /112 variables (removed 53) and now considering 104/224 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 59/112 places, 104/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Graph (trivial) has 122 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 60 transition count 126
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 60 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 98 place count 60 transition count 123
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 55 transition count 113
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 55 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 55 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 53 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 53 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 51 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 51 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 51 transition count 94
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 51 transition count 90
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 3 with 4 rules applied. Total rules applied 133 place count 49 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 48 transition count 87
Applied a total of 134 rules in 34 ms. Remains 48 /112 variables (removed 64) and now considering 87/224 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 48/112 places, 87/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 62 transition count 125
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 62 transition count 125
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 62 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 110 place count 55 transition count 108
Iterating global reduction 1 with 7 rules applied. Total rules applied 117 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 126 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 129 place count 52 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 49 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 49 transition count 87
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 143 place count 49 transition count 79
Applied a total of 143 rules in 9 ms. Remains 49 /112 variables (removed 63) and now considering 79/224 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 49/112 places, 79/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Graph (trivial) has 154 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 60 transition count 126
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 60 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 98 place count 60 transition count 123
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 55 transition count 113
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 55 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 52 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 52 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 49 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 49 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 129 place count 49 transition count 89
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 49 transition count 85
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 137 place count 47 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 46 transition count 82
Applied a total of 138 rules in 24 ms. Remains 46 /112 variables (removed 66) and now considering 82/224 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 46/112 places, 82/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Graph (trivial) has 157 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 58 transition count 122
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 58 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 102 place count 58 transition count 119
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 109 place count 51 transition count 105
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 51 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 122 place count 51 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 48 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 45 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 45 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 143 place count 45 transition count 75
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 45 transition count 71
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 3 with 4 rules applied. Total rules applied 151 place count 43 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 42 transition count 68
Applied a total of 152 rules in 23 ms. Remains 42 /112 variables (removed 70) and now considering 68/224 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 42/112 places, 68/224 transitions.
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:57:20] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:57:20] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 922 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 485660 steps, run visited all 1 properties in 472 ms. (steps per millisecond=1028 )
Probabilistic random walk after 485660 steps, saw 64111 distinct states, run finished after 472 ms. (steps per millisecond=1028 ) properties seen :1
FORMULA HealthRecord-PT-12-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 74 transition count 149
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 74 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 69 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 69 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 69 transition count 138
Applied a total of 87 rules in 4 ms. Remains 69 /112 variables (removed 43) and now considering 138/224 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/112 places, 138/224 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:57:21] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 137
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 63 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 63 transition count 124
Applied a total of 101 rules in 4 ms. Remains 63 /112 variables (removed 49) and now considering 124/224 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/112 places, 124/224 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:57:21] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 62 transition count 125
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 62 transition count 125
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 62 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 110 place count 55 transition count 108
Iterating global reduction 1 with 7 rules applied. Total rules applied 117 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 126 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 129 place count 52 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 49 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 49 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 49 transition count 78
Applied a total of 144 rules in 7 ms. Remains 49 /112 variables (removed 63) and now considering 78/224 (removed 146) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 49/112 places, 78/224 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:57:21] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 126
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 63 transition count 123
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 57 transition count 111
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 57 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 119 place count 57 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 56 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 55 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 55 transition count 97
Applied a total of 126 rules in 7 ms. Remains 55 /112 variables (removed 57) and now considering 97/224 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 55/112 places, 97/224 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:21] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 65 transition count 130
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 65 transition count 130
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 65 transition count 127
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 59 transition count 115
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 59 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 114 place count 59 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 58 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 58 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 57 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 57 transition count 102
Applied a total of 121 rules in 7 ms. Remains 57 /112 variables (removed 55) and now considering 102/224 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 57/112 places, 102/224 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:57:21] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 224/224 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 64 transition count 126
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 58 transition count 114
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 58 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 117 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 56 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 55 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 55 transition count 97
Applied a total of 126 rules in 9 ms. Remains 55 /112 variables (removed 57) and now considering 97/224 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 55/112 places, 97/224 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:57:21] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:57:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:57:21] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:57:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 224 transitions and 640 arcs took 2 ms.
Total runtime 10205 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: 112 NrTr: 224 NrArc: 640)

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

net check time: 0m 0.000sec

init dd package: 0m 3.269sec


RS generation: 0m40.983sec


-> reachability set: #nodes 646576 (6.5e+05) #states 122,163,407 (8)



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

checking: EG [AF [AX [AG [[p18<=0 & 0<=p18]]]]]
normalized: EG [~ [EG [EX [E [true U ~ [[p18<=0 & 0<=p18]]]]]]]

abstracting: (0<=p18)
states: 122,163,407 (8)
abstracting: (p18<=0)
states: 109,272,767 (8)
......
before gc: list nodes free: 1144298

after gc: idd nodes used:1646835, unused:62353165; list nodes free:282322309
....
EG iterations: 9
MC time: 4m14.187sec

checking: EF [[EG [[p41<=1 & 1<=p41]] | [p25<=1 & 1<=p25]]]
normalized: E [true U [[p25<=1 & 1<=p25] | EG [[p41<=1 & 1<=p41]]]]

abstracting: (1<=p41)
states: 30,540,849 (7)
abstracting: (p41<=1)
states: 122,163,407 (8)
..........
EG iterations: 10
abstracting: (1<=p25)
states: 9,935,616 (6)
abstracting: (p25<=1)
states: 122,163,407 (8)
-> the formula is TRUE

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

MC time: 1m50.081sec

checking: AX [[E [EF [AG [[p37<=1 & 1<=p37]]] U EG [AG [[p24<=1 & 1<=p24]]]] & AF [[p0<=0 & 0<=p0]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[p0<=0 & 0<=p0]]]] & E [E [true U ~ [E [true U ~ [[p37<=1 & 1<=p37]]]]] U EG [~ [E [true U ~ [[p24<=1 & 1<=p24]]]]]]]]]]

abstracting: (1<=p24)
states: 9,478,992 (6)
abstracting: (p24<=1)
states: 122,163,407 (8)
.
EG iterations: 1
abstracting: (1<=p37)
states: 3,653,424 (6)
abstracting: (p37<=1)
states: 122,163,407 (8)
abstracting: (0<=p0)
states: 122,163,407 (8)
abstracting: (p0<=0)
states: 122,163,406 (8)
..
EG iterations: 2

before gc: list nodes free: 1261596

after gc: idd nodes used:1356139, unused:62643861; list nodes free:283535700
.-> the formula is FALSE

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

MC time: 1m37.653sec

checking: E [[p70<=1 & 1<=p70] U ~ [EF [[AF [AG [[p100<=1 & 1<=p100]]] & [p80<=1 & 1<=p80]]]]]
normalized: E [[p70<=1 & 1<=p70] U ~ [E [true U [~ [EG [E [true U ~ [[p100<=1 & 1<=p100]]]]] & [p80<=1 & 1<=p80]]]]]

abstracting: (1<=p80)
states: 2,496,096 (6)
abstracting: (p80<=1)
states: 122,163,407 (8)
abstracting: (1<=p100)
states: 7,075,584 (6)
abstracting: (p100<=1)
states: 122,163,407 (8)

EG iterations: 0
abstracting: (1<=p70)
states: 2,962,608 (6)
abstracting: (p70<=1)
states: 122,163,407 (8)
-> the formula is TRUE

FORMULA HealthRecord-PT-12-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m36.865sec

checking: EF [AX [A [~ [AG [[p27<=1 & 1<=p27]]] U [[p20<=1 & 1<=p20] & [p109<=1 & 1<=p109]]]]]
normalized: E [true U ~ [EX [~ [[~ [EG [~ [[[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]] U [~ [E [true U ~ [[p27<=1 & 1<=p27]]]] & ~ [[[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]]]]]]]]]]

abstracting: (1<=p20)
states: 19,788,864 (7)
abstracting: (p20<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p27)
states: 5,116,368 (6)
abstracting: (p27<=1)
states: 122,163,407 (8)
abstracting: (1<=p20)
states: 19,788,864 (7)
abstracting: (p20<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p20)
states: 19,788,864 (7)
abstracting: (p20<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
.
EG iterations: 1
.
before gc: list nodes free: 550014

after gc: idd nodes used:1318679, unused:62681321; list nodes free:283499099
-> the formula is TRUE

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

MC time: 3m57.269sec

checking: EX [[AF [AX [EG [[p15<=0 & 0<=p15]]]] | EG [~ [E [[[p65<=1 & 1<=p65] & [p33<=1 & 1<=p33]] U AG [[[p76<=1 & 1<=p76] & [p92<=1 & 1<=p92]]]]]]]]
normalized: EX [[EG [~ [E [[[p33<=1 & 1<=p33] & [p65<=1 & 1<=p65]] U ~ [E [true U ~ [[[p92<=1 & 1<=p92] & [p76<=1 & 1<=p76]]]]]]]] | ~ [EG [EX [~ [EG [[p15<=0 & 0<=p15]]]]]]]]

abstracting: (0<=p15)
states: 122,163,407 (8)
abstracting: (p15<=0)
states: 115,207,007 (8)
.
EG iterations: 1
..........
EG iterations: 9
abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p92)
states: 97,200 (4)
abstracting: (p92<=1)
states: 122,163,407 (8)
abstracting: (1<=p65)
states: 11,481,984 (7)
abstracting: (p65<=1)
states: 122,163,407 (8)
abstracting: (1<=p33)
states: 4,525,200 (6)
abstracting: (p33<=1)
states: 122,163,407 (8)

EG iterations: 0
.-> the formula is TRUE

FORMULA HealthRecord-PT-12-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 4.572sec

checking: AG [E [[p61<=1 & 1<=p61] U EG [~ [[~ [[[p35<=1 & 1<=p35] & [p109<=1 & 1<=p109]]] & E [[[p10<=1 & 1<=p10] & [p109<=1 & 1<=p109]] U [p64<=1 & 1<=p64]]]]]]]
normalized: ~ [E [true U ~ [E [[p61<=1 & 1<=p61] U EG [~ [[E [[[p109<=1 & 1<=p109] & [p10<=1 & 1<=p10]] U [p64<=1 & 1<=p64]] & ~ [[[p109<=1 & 1<=p109] & [p35<=1 & 1<=p35]]]]]]]]]]

abstracting: (1<=p35)
states: 14,681,040 (7)
abstracting: (p35<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p64)
states: 873,600 (5)
abstracting: (p64<=1)
states: 122,163,407 (8)
abstracting: (1<=p10)
states: 20,005,692 (7)
abstracting: (p10<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
.
EG iterations: 1
abstracting: (1<=p61)
states: 11,509,152 (7)
abstracting: (p61<=1)
states: 122,163,407 (8)

before gc: list nodes free: 299509

after gc: idd nodes used:1824378, unused:62175622; list nodes free:283208362
-> the formula is FALSE

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

MC time: 2m 8.546sec

checking: ~ [E [E [[[1<=p7 & p7<=1] | [~ [[[1<=p31 & p31<=1] & [p34<=1 & 1<=p34]]] & [[[p17<=1 & 1<=p17] & [p28<=1 & 1<=p28]] | ~ [[p62<=1 & 1<=p62]]]]] U EF [[p69<=1 & 1<=p69]]] U [[p76<=1 & 1<=p76] & [p84<=1 & 1<=p84]]]]
normalized: ~ [E [E [[[~ [[[1<=p31 & p31<=1] & [p34<=1 & 1<=p34]]] & [~ [[p62<=1 & 1<=p62]] | [[p28<=1 & 1<=p28] & [p17<=1 & 1<=p17]]]] | [1<=p7 & p7<=1]] U E [true U [p69<=1 & 1<=p69]]] U [[p84<=1 & 1<=p84] & [p76<=1 & 1<=p76]]]]

abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p84)
states: 404,352 (5)
abstracting: (p84<=1)
states: 122,163,407 (8)
abstracting: (1<=p69)
states: 2,689,632 (6)
abstracting: (p69<=1)
states: 122,163,407 (8)
abstracting: (p7<=1)
states: 122,163,407 (8)
abstracting: (1<=p7)
states: 6,357,600 (6)
abstracting: (1<=p17)
states: 6,067,200 (6)
abstracting: (p17<=1)
states: 122,163,407 (8)
abstracting: (1<=p28)
states: 5,750,400 (6)
abstracting: (p28<=1)
states: 122,163,407 (8)
abstracting: (1<=p62)
states: 834,000 (5)
abstracting: (p62<=1)
states: 122,163,407 (8)
abstracting: (1<=p34)
states: 9,935,568 (6)
abstracting: (p34<=1)
states: 122,163,407 (8)
abstracting: (p31<=1)
states: 122,163,407 (8)
abstracting: (1<=p31)
states: 9,943,968 (6)
-> the formula is FALSE

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

MC time: 1m20.005sec

checking: AF [[EF [[AG [[p5<=0 & 0<=p5]] & [[p4<=0 & 0<=p4] & ~ [A [[[p76<=1 & 1<=p76] & [p92<=1 & 1<=p92]] U [p22<=1 & 1<=p22]]]]]] | [EG [[p30<=1 & 1<=p30]] & [[[p76<=1 & 1<=p76] & [p85<=1 & 1<=p85]] | [AF [[p98<=1 & 1<=p98]] & EX [EX [[p55<=1 & 1<=p55]]]]]]]]
normalized: ~ [EG [~ [[[[[EX [EX [[p55<=1 & 1<=p55]]] & ~ [EG [~ [[p98<=1 & 1<=p98]]]]] | [[p85<=1 & 1<=p85] & [p76<=1 & 1<=p76]]] & EG [[p30<=1 & 1<=p30]]] | E [true U [[~ [[~ [EG [~ [[p22<=1 & 1<=p22]]]] & ~ [E [~ [[p22<=1 & 1<=p22]] U [~ [[[p92<=1 & 1<=p92] & [p76<=1 & 1<=p76]]] & ~ [[p22<=1 & 1<=p22]]]]]]] & [p4<=0 & 0<=p4]] & ~ [E [true U ~ [[p5<=0 & 0<=p5]]]]]]]]]]

abstracting: (0<=p5)
states: 122,163,407 (8)
abstracting: (p5<=0)
states: 115,923,839 (8)
abstracting: (0<=p4)
states: 122,163,407 (8)
abstracting: (p4<=0)
states: 109,293,551 (8)
abstracting: (1<=p22)
states: 4,418,064 (6)
abstracting: (p22<=1)
states: 122,163,407 (8)
abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p92)
states: 97,200 (4)
abstracting: (p92<=1)
states: 122,163,407 (8)
abstracting: (1<=p22)
states: 4,418,064 (6)
abstracting: (p22<=1)
states: 122,163,407 (8)
abstracting: (1<=p22)
states: 4,418,064 (6)
abstracting: (p22<=1)
states: 122,163,407 (8)

before gc: list nodes free: 8086380

after gc: idd nodes used:2925251, unused:61074749; list nodes free:278277319
...
EG iterations: 3
MC time: 5m47.080sec

checking: EG [[AX [~ [A [EF [[p63<=1 & 1<=p63]] U [[[p35<=1 & 1<=p35] & [p109<=1 & 1<=p109]] & [[p58<=1 & 1<=p58] & [p109<=1 & 1<=p109]]]]]] & AF [AG [[[p45<=0 & 0<=p45] & [[[p10<=0 & 0<=p10] | [p20<=0 & 0<=p20]] | [[p35<=0 & 0<=p35] | [p96<=0 & 0<=p96]]]]]]]]
normalized: EG [[~ [EG [E [true U ~ [[[[[p96<=0 & 0<=p96] | [p35<=0 & 0<=p35]] | [[p20<=0 & 0<=p20] | [p10<=0 & 0<=p10]]] & [p45<=0 & 0<=p45]]]]]] & ~ [EX [[~ [EG [~ [[[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]] & [[p109<=1 & 1<=p109] & [p35<=1 & 1<=p35]]]]]] & ~ [E [~ [[[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]] & [[p109<=1 & 1<=p109] & [p35<=1 & 1<=p35]]]] U [~ [E [true U [p63<=1 & 1<=p63]]] & ~ [[[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]] & [[p109<=1 & 1<=p109] & [p35<=1 & 1<=p35]]]]]]]]]]]]

abstracting: (1<=p35)
states: 14,681,040 (7)
abstracting: (p35<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p58)
states: 26,109,420 (7)
abstracting: (p58<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p63)
states: 813,600 (5)
abstracting: (p63<=1)
states: 122,163,407 (8)

before gc: list nodes free: 4418289

after gc: idd nodes used:2781073, unused:61218927; list nodes free:278904657
abstracting: (1<=p35)
states: 14,681,040 (7)
abstracting: (p35<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p58)
states: 26,109,420 (7)
abstracting: (p58<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
MC time: 4m58.013sec

checking: AG [[EF [EG [[[p19<=0 & 0<=p19] | EG [[[p53<=1 & 1<=p53] & [p109<=1 & 1<=p109]]]]]] | A [[[[[p35<=1 & 1<=p35] & [p109<=1 & 1<=p109]] | EX [[p67<=1 & 1<=p67]]] & ~ [[[[p17<=1 & 1<=p17] & [[p76<=1 & 1<=p76] & [p85<=1 & 1<=p85]]] | ~ [[p45<=1 & 1<=p45]]]]] U [[p58<=1 & 1<=p58] & [p109<=1 & 1<=p109]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]]]]] & ~ [E [~ [[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]]] U [~ [[~ [[~ [[p45<=1 & 1<=p45]] | [[[p85<=1 & 1<=p85] & [p76<=1 & 1<=p76]] & [p17<=1 & 1<=p17]]]] & [EX [[p67<=1 & 1<=p67]] | [[p109<=1 & 1<=p109] & [p35<=1 & 1<=p35]]]]] & ~ [[[p109<=1 & 1<=p109] & [p58<=1 & 1<=p58]]]]]]] | E [true U EG [[EG [[[p109<=1 & 1<=p109] & [p53<=1 & 1<=p53]]] | [p19<=0 & 0<=p19]]]]]]]]

abstracting: (0<=p19)
states: 122,163,407 (8)
abstracting: (p19<=0)
states: 109,260,815 (8)
abstracting: (1<=p53)
states: 30,541,092 (7)
abstracting: (p53<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
......
EG iterations: 6

before gc: list nodes free: 10530733

after gc: idd nodes used:3561189, unused:60438811; list nodes free:275583802
.
EG iterations: 1
abstracting: (1<=p58)
states: 26,109,420 (7)
abstracting: (p58<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p35)
states: 14,681,040 (7)
abstracting: (p35<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p67)
states: 11,588,256 (7)
abstracting: (p67<=1)
states: 122,163,407 (8)
.abstracting: (1<=p17)
states: 6,067,200 (6)
abstracting: (p17<=1)
states: 122,163,407 (8)
abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p85)
states: 97,200 (4)
abstracting: (p85<=1)
states: 122,163,407 (8)
abstracting: (1<=p45)
states: 10
abstracting: (p45<=1)
states: 122,163,407 (8)
abstracting: (1<=p58)
states: 26,109,420 (7)
abstracting: (p58<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p58)
states: 26,109,420 (7)
abstracting: (p58<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
MC time: 4m15.118sec

checking: [EX [[[p32<=1 & 1<=p32] & [[p16<=1 & 1<=p16] | [[p76<=1 & 1<=p76] & [p89<=1 & 1<=p89]]]]] | EF [[[E [[[p76<=1 & 1<=p76] & [p82<=1 & 1<=p82]] U [p95<=1 & 1<=p95]] & [[[AX [[p10<=1 & 1<=p10]] | [p81<=1 & 1<=p81]] | [[p105<=1 & 1<=p105] | [[[p23<=1 & 1<=p23] & [p109<=1 & 1<=p109]] | [p66<=1 & 1<=p66]]]] | [[[p10<=0 & 0<=p10] | [p20<=0 & 0<=p20]] | [[p35<=0 & 0<=p35] | [[p96<=0 & 0<=p96] | [p75<=1 & 1<=p75]]]]]] & [[p20<=1 & 1<=p20] & [[p109<=1 & 1<=p109] & [p29<=0 & 0<=p29]]]]]]
normalized: [E [true U [[[[[[[p66<=1 & 1<=p66] | [[p109<=1 & 1<=p109] & [p23<=1 & 1<=p23]]] | [p105<=1 & 1<=p105]] | [[p81<=1 & 1<=p81] | ~ [EX [~ [[p10<=1 & 1<=p10]]]]]] | [[[[p75<=1 & 1<=p75] | [p96<=0 & 0<=p96]] | [p35<=0 & 0<=p35]] | [[p20<=0 & 0<=p20] | [p10<=0 & 0<=p10]]]] & E [[[p82<=1 & 1<=p82] & [p76<=1 & 1<=p76]] U [p95<=1 & 1<=p95]]] & [[[p109<=1 & 1<=p109] & [p29<=0 & 0<=p29]] & [p20<=1 & 1<=p20]]]] | EX [[[[[p89<=1 & 1<=p89] & [p76<=1 & 1<=p76]] | [p16<=1 & 1<=p16]] & [p32<=1 & 1<=p32]]]]

abstracting: (1<=p32)
states: 9,943,968 (6)
abstracting: (p32<=1)
states: 122,163,407 (8)
abstracting: (1<=p16)
states: 6,357,600 (6)
abstracting: (p16<=1)
states: 122,163,407 (8)
abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p89)
states: 97,200 (4)
abstracting: (p89<=1)
states: 122,163,407 (8)
.abstracting: (1<=p20)
states: 19,788,864 (7)
abstracting: (p20<=1)
states: 122,163,407 (8)
abstracting: (0<=p29)
states: 122,163,407 (8)
abstracting: (p29<=0)
states: 116,996,207 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p95)
states: 97,200 (4)
abstracting: (p95<=1)
states: 122,163,407 (8)
abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p82)
states: 7,075,584 (6)
abstracting: (p82<=1)
states: 122,163,407 (8)
abstracting: (0<=p10)
states: 122,163,407 (8)
abstracting: (p10<=0)
states: 102,157,715 (8)
abstracting: (0<=p20)
states: 122,163,407 (8)
abstracting: (p20<=0)
states: 102,374,543 (8)
abstracting: (0<=p35)
states: 122,163,407 (8)
abstracting: (p35<=0)
states: 107,482,367 (8)
abstracting: (0<=p96)
states: 122,163,407 (8)
abstracting: (p96<=0)
states: 119,667,311 (8)
abstracting: (1<=p75)
states: 1
abstracting: (p75<=1)
states: 122,163,407 (8)
abstracting: (1<=p10)
states: 20,005,692 (7)
abstracting: (p10<=1)
states: 122,163,407 (8)

before gc: list nodes free: 975336

after gc: idd nodes used:4150206, unused:59849794; list nodes free:272486878
.abstracting: (1<=p81)
states: 7,065,984 (6)
abstracting: (p81<=1)
states: 122,163,407 (8)
abstracting: (1<=p105)
states: 1
abstracting: (p105<=1)
states: 122,163,407 (8)
abstracting: (1<=p23)
states: 3,354,228 (6)
abstracting: (p23<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
abstracting: (1<=p66)
states: 11,483,184 (7)
abstracting: (p66<=1)
states: 122,163,407 (8)
-> the formula is FALSE

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

MC time: 1m17.794sec

checking: [EF [EG [[[[[p11<=1 & 1<=p11] & [p21<=1 & 1<=p21]] & [[p36<=1 & 1<=p36] & [[p40<=1 & 1<=p40] & [p44<=1 & 1<=p44]]]] & [[[p49<=1 & 1<=p49] & [p54<=1 & 1<=p54]] & [[p59<=1 & 1<=p59] & [[p77<=1 & 1<=p77] & [p106<=1 & 1<=p106]]]]]]] | A [EX [[[AX [[p14<=1 & 1<=p14]] & EF [[p56<=1 & 1<=p56]]] & [AX [[p14<=1 & 1<=p14]] & [[p32<=1 & 1<=p32] & [[p66<=1 & 1<=p66] | [p28<=1 & 1<=p28]]]]]] U [AX [[[p10<=1 & 1<=p10] & [p109<=1 & 1<=p109]]] | [EF [EX [[[p20<=1 & 1<=p20] & [p109<=1 & 1<=p109]]]] & [[E [[p14<=1 & 1<=p14] U [p9<=1 & 1<=p9]] | EF [[p50<=1 & 1<=p50]]] & [p83<=1 & 1<=p83]]]]]]
normalized: [[~ [EG [~ [[[[[p83<=1 & 1<=p83] & [E [true U [p50<=1 & 1<=p50]] | E [[p14<=1 & 1<=p14] U [p9<=1 & 1<=p9]]]] & E [true U EX [[[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]]]] | ~ [EX [~ [[[p109<=1 & 1<=p109] & [p10<=1 & 1<=p10]]]]]]]]] & ~ [E [~ [[[[[p83<=1 & 1<=p83] & [E [true U [p50<=1 & 1<=p50]] | E [[p14<=1 & 1<=p14] U [p9<=1 & 1<=p9]]]] & E [true U EX [[[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]]]] | ~ [EX [~ [[[p109<=1 & 1<=p109] & [p10<=1 & 1<=p10]]]]]]] U [~ [EX [[[[[[p28<=1 & 1<=p28] | [p66<=1 & 1<=p66]] & [p32<=1 & 1<=p32]] & ~ [EX [~ [[p14<=1 & 1<=p14]]]]] & [E [true U [p56<=1 & 1<=p56]] & ~ [EX [~ [[p14<=1 & 1<=p14]]]]]]]] & ~ [[[[[p83<=1 & 1<=p83] & [E [true U [p50<=1 & 1<=p50]] | E [[p14<=1 & 1<=p14] U [p9<=1 & 1<=p9]]]] & E [true U EX [[[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]]]] | ~ [EX [~ [[[p109<=1 & 1<=p109] & [p10<=1 & 1<=p10]]]]]]]]]]] | E [true U EG [[[[[[p106<=1 & 1<=p106] & [p77<=1 & 1<=p77]] & [p59<=1 & 1<=p59]] & [[p54<=1 & 1<=p54] & [p49<=1 & 1<=p49]]] & [[[[p44<=1 & 1<=p44] & [p40<=1 & 1<=p40]] & [p36<=1 & 1<=p36]] & [[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]]]]]]

abstracting: (1<=p11)
states: 20,005,692 (7)
abstracting: (p11<=1)
states: 122,163,407 (8)
abstracting: (1<=p21)
states: 19,788,864 (7)
abstracting: (p21<=1)
states: 122,163,407 (8)
abstracting: (1<=p36)
states: 14,681,040 (7)
abstracting: (p36<=1)
states: 122,163,407 (8)
abstracting: (1<=p40)
states: 30,540,849 (7)
abstracting: (p40<=1)
states: 122,163,407 (8)
abstracting: (1<=p44)
states: 40,721,132 (7)
abstracting: (p44<=1)
states: 122,163,407 (8)
abstracting: (1<=p49)
states: 25,027,500 (7)
abstracting: (p49<=1)
states: 122,163,407 (8)
abstracting: (1<=p54)
states: 30,541,092 (7)
abstracting: (p54<=1)
states: 122,163,407 (8)
abstracting: (1<=p59)
states: 26,109,420 (7)
abstracting: (p59<=1)
states: 122,163,407 (8)
abstracting: (1<=p77)
states: 20,645,869 (7)
abstracting: (p77<=1)
states: 122,163,407 (8)
abstracting: (1<=p106)
states: 97,200 (4)
abstracting: (p106<=1)
states: 122,163,407 (8)
..
EG iterations: 2
abstracting: (1<=p10)
states: 20,005,692 (7)
abstracting: (p10<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
.abstracting: (1<=p20)
states: 19,788,864 (7)
abstracting: (p20<=1)
states: 122,163,407 (8)
abstracting: (1<=p109)
states: 7,840,656 (6)
abstracting: (p109<=1)
states: 122,163,407 (8)
.
before gc: list nodes free: 2667311

after gc: idd nodes used:4339504, unused:59660496; list nodes free:272050674
MC time: 4m 2.189sec

checking: E [[EF [EG [[p82<=1 & 1<=p82]]] | [[A [[[[p10<=1 & 1<=p10] & [p20<=1 & 1<=p20]] & [[p35<=1 & 1<=p35] & [p96<=1 & 1<=p96]]] U [[p6<=1 & 1<=p6] & [[p43<=1 & 1<=p43] & [p109<=1 & 1<=p109]]]] & EF [[[p35<=1 & 1<=p35] & [[p109<=1 & 1<=p109] & [p20<=1 & 1<=p20]]]]] & [~ [[[[p48<=1 & 1<=p48] & [[p109<=1 & 1<=p109] & ~ [[[p52<=1 & 1<=p52] & [p25<=1 & 1<=p25]]]]] | EG [A [[p88<=1 & 1<=p88] U [p100<=1 & 1<=p100]]]]] & [E [[[p22<=1 & 1<=p22] | [p63<=1 & 1<=p63]] U [[p68<=1 & 1<=p68] | [p47<=1 & 1<=p47]]] | E [A [[[p12<=1 & 1<=p12] & [p109<=1 & 1<=p109]] U [p68<=1 & 1<=p68]] U EX [[p111<=1 & 1<=p111]]]]]]] U [~ [A [[p3<=1 & 1<=p3] U ~ [[p66<=1 & 1<=p66]]]] | [p99<=1 & 1<=p99]]]
normalized: E [[[[[E [[~ [EG [~ [[p68<=1 & 1<=p68]]]] & ~ [E [~ [[p68<=1 & 1<=p68]] U [~ [[[p109<=1 & 1<=p109] & [p12<=1 & 1<=p12]]] & ~ [[p68<=1 & 1<=p68]]]]]] U EX [[p111<=1 & 1<=p111]]] | E [[[p63<=1 & 1<=p63] | [p22<=1 & 1<=p22]] U [[p47<=1 & 1<=p47] | [p68<=1 & 1<=p68]]]] & ~ [[EG [[~ [EG [~ [[p100<=1 & 1<=p100]]]] & ~ [E [~ [[p100<=1 & 1<=p100]] U [~ [[p88<=1 & 1<=p88]] & ~ [[p100<=1 & 1<=p100]]]]]]] | [[~ [[[p25<=1 & 1<=p25] & [p52<=1 & 1<=p52]]] & [p109<=1 & 1<=p109]] & [p48<=1 & 1<=p48]]]]] & [E [true U [[[p20<=1 & 1<=p20] & [p109<=1 & 1<=p109]] & [p35<=1 & 1<=p35]]] & [~ [EG [~ [[[[p109<=1 & 1<=p109] & [p43<=1 & 1<=p43]] & [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[[[p109<=1 & 1<=p109] & [p43<=1 & 1<=p43]] & [p6<=1 & 1<=p6]]] U [~ [[[[p96<=1 & 1<=p96] & [p35<=1 & 1<=p35]] & [[p20<=1 & 1<=p20] & [p10<=1 & 1<=p10]]]] & ~ [[[[p109<=1 & 1<=p109] & [p43<=1 & 1<=p43]] & [p6<=1 & 1<=p6]]]]]]]]] | E [true U EG [[p82<=1 & 1<=p82]]]] U [[p99<=1 & 1<=p99] | ~ [[~ [EG [[p66<=1 & 1<=p66]]] & ~ [E [[p66<=1 & 1<=p66] U [~ [[p3<=1 & 1<=p3]] & [p66<=1 & 1<=p66]]]]]]]]

abstracting: (1<=p66)
states: 11,483,184 (7)
abstracting: (p66<=1)
states: 122,163,407 (8)
abstracting: (1<=p3)
states: 13,378,800 (7)
abstracting: (p3<=1)
states: 122,163,407 (8)
abstracting: (1<=p66)
states: 11,483,184 (7)
abstracting: (p66<=1)
states: 122,163,407 (8)
abstracting: (1<=p66)
states: 11,483,184 (7)
abstracting: (p66<=1)
states: 122,163,407 (8)
..........
EG iterations: 10
abstracting: (1<=p99)
states: 2,496,096 (6)
abstracting: (p99<=1)
states: 122,163,407 (8)
abstracting: (1<=p82)
states: 7,075,584 (6)
abstracting: (p82<=1)
states: 122,163,407 (8)
.......
EG iterations: 7
MC time: 3m22.156sec

checking: EG [AF [AX [AG [[p18<=0 & 0<=p18]]]]]
normalized: EG [~ [EG [EX [E [true U ~ [[p18<=0 & 0<=p18]]]]]]]

abstracting: (0<=p18)
states: 122,163,407 (8)
abstracting: (p18<=0)
states: 109,272,767 (8)

before gc: list nodes free: 8680748

after gc: idd nodes used:4381558, unused:59618442; list nodes free:271851521
..........
EG iterations: 9
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 4m55.833sec

checking: AF [[EF [[AG [[p5<=0 & 0<=p5]] & [[p4<=0 & 0<=p4] & ~ [A [[[p76<=1 & 1<=p76] & [p92<=1 & 1<=p92]] U [p22<=1 & 1<=p22]]]]]] | [EG [[p30<=1 & 1<=p30]] & [[[p76<=1 & 1<=p76] & [p85<=1 & 1<=p85]] | [AF [[p98<=1 & 1<=p98]] & EX [EX [[p55<=1 & 1<=p55]]]]]]]]
normalized: ~ [EG [~ [[[[[EX [EX [[p55<=1 & 1<=p55]]] & ~ [EG [~ [[p98<=1 & 1<=p98]]]]] | [[p85<=1 & 1<=p85] & [p76<=1 & 1<=p76]]] & EG [[p30<=1 & 1<=p30]]] | E [true U [[~ [[~ [EG [~ [[p22<=1 & 1<=p22]]]] & ~ [E [~ [[p22<=1 & 1<=p22]] U [~ [[[p92<=1 & 1<=p92] & [p76<=1 & 1<=p76]]] & ~ [[p22<=1 & 1<=p22]]]]]]] & [p4<=0 & 0<=p4]] & ~ [E [true U ~ [[p5<=0 & 0<=p5]]]]]]]]]]

abstracting: (0<=p5)
states: 122,163,407 (8)
abstracting: (p5<=0)
states: 115,923,839 (8)

before gc: list nodes free: 1371352

after gc: idd nodes used:4245782, unused:59754218; list nodes free:272434862
abstracting: (0<=p4)
states: 122,163,407 (8)
abstracting: (p4<=0)
states: 109,293,551 (8)
abstracting: (1<=p22)
states: 4,418,064 (6)
abstracting: (p22<=1)
states: 122,163,407 (8)
abstracting: (1<=p76)
states: 20,645,868 (7)
abstracting: (p76<=1)
states: 122,163,407 (8)
abstracting: (1<=p92)
states: 97,200 (4)
abstracting: (p92<=1)
states: 122,163,407 (8)
abstracting: (1<=p22)
states: 4,418,064 (6)
abstracting: (p22<=1)
states: 122,163,407 (8)
abstracting: (1<=p22)
states: 4,418,064 (6)
abstracting: (p22<=1)
states: 122,163,407 (8)
...
EG iterations: 3

before gc: list nodes free: 3652666

after gc: idd nodes used:4353969, unused:59646031; list nodes free:271896302
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6055612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095904 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

9023 11553
iterations count:265305 (1184), effective:12537 (55)

initing FirstDep: 0m 0.000sec


iterations count:3842 (17), effective:222 (0)

net_ddint.h:600: Timeout: after 253 sec


iterations count:4015 (17), effective:227 (1)

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

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

iterations count:499 (2), effective:13 (0)

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

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

iterations count:18297 (81), effective:769 (3)

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

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

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

iterations count:5458 (24), effective:316 (1)

iterations count:2052 (9), effective:105 (0)

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

iterations count:2849 (12), effective:149 (0)

iterations count:5081 (22), effective:293 (1)

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

sat_reach.icc:155: Timeout: after 346 sec


iterations count:5194 (23), effective:300 (1)

sat_reach.icc:155: Timeout: after 297 sec


iterations count:1080 (4), effective:58 (0)

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

net_ddint.h:600: Timeout: after 254 sec


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

sat_reach.icc:155: Timeout: after 241 sec


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

sat_reach.icc:155: Timeout: after 201 sec


iterations count:3842 (17), effective:222 (0)

iterations count:5081 (22), effective:293 (1)

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

iterations count:7846 (35), effective:464 (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-12"
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-12, 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-167840348500322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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