MCC'2023- Execution of r202-smll-167840348500314

About the Execution of Marcie+red for HealthRecord-PT-11

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
10560.023	2950105.00	2987996.00	7969.40	TFFFFTFTFTFFFTFT	normal

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-167840348500314.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is HealthRecord-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-CTLFireability-00
FORMULA_NAME HealthRecord-PT-11-CTLFireability-01
FORMULA_NAME HealthRecord-PT-11-CTLFireability-02
FORMULA_NAME HealthRecord-PT-11-CTLFireability-03
FORMULA_NAME HealthRecord-PT-11-CTLFireability-04
FORMULA_NAME HealthRecord-PT-11-CTLFireability-05
FORMULA_NAME HealthRecord-PT-11-CTLFireability-06
FORMULA_NAME HealthRecord-PT-11-CTLFireability-07
FORMULA_NAME HealthRecord-PT-11-CTLFireability-08
FORMULA_NAME HealthRecord-PT-11-CTLFireability-09
FORMULA_NAME HealthRecord-PT-11-CTLFireability-10
FORMULA_NAME HealthRecord-PT-11-CTLFireability-11
FORMULA_NAME HealthRecord-PT-11-CTLFireability-12
FORMULA_NAME HealthRecord-PT-11-CTLFireability-13
FORMULA_NAME HealthRecord-PT-11-CTLFireability-14
FORMULA_NAME HealthRecord-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678697859380

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-11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 08:57:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 08:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 08:57:42] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-13 08:57:42] [INFO ] Transformed 159 places.
[2023-03-13 08:57:42] [INFO ] Transformed 334 transitions.
[2023-03-13 08:57:42] [INFO ] Found NUPN structural information;
[2023-03-13 08:57:42] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 78 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 117 transition count 231
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 117 transition count 231
Applied a total of 84 rules in 58 ms. Remains 117 /159 variables (removed 42) and now considering 231/307 (removed 76) transitions.
[2023-03-13 08:57:43] [INFO ] Flow matrix only has 227 transitions (discarded 4 similar events)
// Phase 1: matrix 227 rows 117 cols
[2023-03-13 08:57:43] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-13 08:57:43] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-13 08:57:43] [INFO ] Flow matrix only has 227 transitions (discarded 4 similar events)
[2023-03-13 08:57:43] [INFO ] Invariant cache hit.
[2023-03-13 08:57:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 08:57:43] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2023-03-13 08:57:43] [INFO ] Flow matrix only has 227 transitions (discarded 4 similar events)
[2023-03-13 08:57:43] [INFO ] Invariant cache hit.
[2023-03-13 08:57:43] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/159 places, 231/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 117/159 places, 231/307 transitions.
Support contains 78 out of 117 places after structural reductions.
[2023-03-13 08:57:44] [INFO ] Flatten gal took : 67 ms
[2023-03-13 08:57:44] [INFO ] Flatten gal took : 27 ms
[2023-03-13 08:57:44] [INFO ] Input system was already deterministic with 231 transitions.
Incomplete random walk after 10000 steps, including 670 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 77) seen :29
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) 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 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) 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 46) 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 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Running SMT prover for 46 properties.
[2023-03-13 08:57:45] [INFO ] Flow matrix only has 227 transitions (discarded 4 similar events)
[2023-03-13 08:57:45] [INFO ] Invariant cache hit.
[2023-03-13 08:57:46] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-13 08:57:46] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-13 08:57:46] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:46
[2023-03-13 08:57:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-13 08:57:46] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-13 08:57:47] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :43
[2023-03-13 08:57:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 08:57:47] [INFO ] After 574ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :43
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 9 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2023-03-13 08:57:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 572 ms
[2023-03-13 08:57:49] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2023-03-13 08:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-13 08:57:49] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2023-03-13 08:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-13 08:57:49] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-13 08:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-13 08:57:49] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-03-13 08:57:49] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2023-03-13 08:57:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-13 08:57:50] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-13 08:57:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-13 08:57:50] [INFO ] After 2777ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :43
Attempting to minimize the solution found.
Minimization took 620 ms.
[2023-03-13 08:57:50] [INFO ] After 4620ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :43
Fused 46 Parikh solutions to 43 different solutions.
Parikh walk visited 4 properties in 321 ms.
Support contains 49 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 61 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 457 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 114 transition count 220
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 112 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 112 transition count 216
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 109 transition count 216
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 32 place count 90 transition count 178
Iterating global reduction 2 with 19 rules applied. Total rules applied 51 place count 90 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 90 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 88 transition count 173
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 88 transition count 173
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 60 place count 86 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 86 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 84 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 84 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 83 transition count 172
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 83 transition count 172
Applied a total of 68 rules in 92 ms. Remains 83 /117 variables (removed 34) and now considering 172/231 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 83/117 places, 172/231 transitions.
Incomplete random walk after 10000 steps, including 1457 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 39) seen :4
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-13 08:57:51] [INFO ] Flow matrix only has 170 transitions (discarded 2 similar events)
// Phase 1: matrix 170 rows 83 cols
[2023-03-13 08:57:51] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-13 08:57:52] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 08:57:52] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-13 08:57:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 08:57:52] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-13 08:57:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 08:57:53] [INFO ] After 338ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2023-03-13 08:57:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 314 ms
[2023-03-13 08:57:54] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2023-03-13 08:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-13 08:57:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-13 08:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-13 08:57:54] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-13 08:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-13 08:57:54] [INFO ] After 1459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-13 08:57:54] [INFO ] After 2434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Parikh walk visited 0 properties in 22 ms.
Support contains 42 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 172/172 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 77 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 76 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 76 transition count 158
Applied a total of 15 rules in 17 ms. Remains 76 /83 variables (removed 7) and now considering 158/172 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 76/83 places, 158/172 transitions.
Incomplete random walk after 10000 steps, including 1469 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Probabilistic random walk after 1000001 steps, saw 129290 distinct states, run finished after 2722 ms. (steps per millisecond=367 ) properties seen :31
Running SMT prover for 1 properties.
[2023-03-13 08:57:58] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
// Phase 1: matrix 156 rows 76 cols
[2023-03-13 08:57:58] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-13 08:57:58] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 08:57:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 08:57:58] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 08:57:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 08:57:58] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 08:57:58] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-13 08:57:58] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-13 08:57:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-13 08:57:58] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-13 08:57:58] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 158/158 transitions.
Graph (trivial) has 71 edges and 76 vertex of which 6 / 76 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 336 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 72 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 71 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 69 transition count 146
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 31 place count 49 transition count 106
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 49 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 56 place count 49 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 47 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 47 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 46 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 46 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 45 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 45 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 45 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 43 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 42 transition count 97
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 42 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 77 place count 40 transition count 95
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 78 place count 40 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 80 place count 39 transition count 107
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 39 transition count 106
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 98 place count 39 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 99 place count 39 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 100 place count 38 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 38 transition count 104
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 37 transition count 102
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 37 transition count 102
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 104 place count 36 transition count 96
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 36 transition count 96
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 35 transition count 94
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 35 transition count 94
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 112 place count 35 transition count 89
Applied a total of 112 rules in 99 ms. Remains 35 /76 variables (removed 41) and now considering 89/158 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 35/76 places, 89/158 transitions.
Incomplete random walk after 10000 steps, including 608 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9729 steps, run visited all 1 properties in 29 ms. (steps per millisecond=335 )
Probabilistic random walk after 9729 steps, saw 2539 distinct states, run finished after 30 ms. (steps per millisecond=324 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 08:57:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 08:57:58] [INFO ] Flatten gal took : 32 ms
FORMULA HealthRecord-PT-11-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 08:57:58] [INFO ] Flatten gal took : 31 ms
[2023-03-13 08:57:58] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 74 out of 117 places (down from 75) after GAL structural reductions.
Computed a total of 15 stabilizing places and 26 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 72 transition count 142
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 72 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 72 transition count 140
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 64 transition count 124
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 64 transition count 124
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 64 transition count 121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 61 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 61 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 58 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 58 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 131 place count 58 transition count 98
Applied a total of 131 rules in 18 ms. Remains 58 /117 variables (removed 59) and now considering 98/231 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 58/117 places, 98/231 transitions.
[2023-03-13 08:57:58] [INFO ] Flatten gal took : 12 ms
[2023-03-13 08:57:58] [INFO ] Flatten gal took : 13 ms
[2023-03-13 08:57:58] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 65 transition count 128
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 65 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 65 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 116 place count 56 transition count 107
Iterating global reduction 1 with 9 rules applied. Total rules applied 125 place count 56 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 54 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 52 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 145 place count 52 transition count 85
Applied a total of 145 rules in 12 ms. Remains 52 /117 variables (removed 65) and now considering 85/231 (removed 146) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 52/117 places, 85/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 104 edges and 117 vertex of which 10 / 117 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 69 transition count 142
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 69 transition count 142
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 69 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 62 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 62 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 62 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 61 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 61 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 60 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 60 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 60 transition count 116
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 60 transition count 112
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 118 place count 58 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 56 transition count 108
Applied a total of 120 rules in 42 ms. Remains 56 /117 variables (removed 61) and now considering 108/231 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 56/117 places, 108/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 9 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 72 transition count 142
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 72 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 72 transition count 140
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 65 transition count 126
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 65 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 112 place count 65 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 63 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 63 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 62 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 62 transition count 112
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 62 transition count 109
Applied a total of 121 rules in 7 ms. Remains 62 /117 variables (removed 55) and now considering 109/231 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 62/117 places, 109/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 65 transition count 128
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 65 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 65 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 58 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 58 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 127 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 56 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 56 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 54 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 54 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 54 transition count 89
Applied a total of 141 rules in 5 ms. Remains 54 /117 variables (removed 63) and now considering 89/231 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 54/117 places, 89/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 165 edges and 117 vertex of which 10 / 117 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 64 transition count 131
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 64 transition count 131
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 64 transition count 128
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 110 place count 54 transition count 108
Iterating global reduction 1 with 10 rules applied. Total rules applied 120 place count 54 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 127 place count 54 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 51 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 48 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 48 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 148 place count 48 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 48 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 44 transition count 69
Applied a total of 160 rules in 23 ms. Remains 44 /117 variables (removed 73) and now considering 69/231 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 44/117 places, 69/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 142 edges and 117 vertex of which 10 / 117 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 63 transition count 129
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 63 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 102 place count 63 transition count 126
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 54 transition count 108
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 54 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 127 place count 54 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 52 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 52 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 50 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 50 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 50 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 50 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 46 transition count 77
Applied a total of 153 rules in 18 ms. Remains 46 /117 variables (removed 71) and now considering 77/231 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 46/117 places, 77/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 77 transition count 151
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 77 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 71 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 71 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 98 place count 71 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 70 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 70 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 69 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 69 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 69 transition count 126
Applied a total of 104 rules in 4 ms. Remains 69 /117 variables (removed 48) and now considering 126/231 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/117 places, 126/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 9 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 76 transition count 149
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 76 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 71 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 71 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 94 place count 71 transition count 137
Applied a total of 94 rules in 2 ms. Remains 71 /117 variables (removed 46) and now considering 137/231 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/117 places, 137/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 9 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 67 transition count 132
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 67 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 67 transition count 130
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 59 transition count 114
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 59 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 124 place count 59 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 57 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 55 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 55 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 55 transition count 92
Applied a total of 138 rules in 4 ms. Remains 55 /117 variables (removed 62) and now considering 92/231 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 55/117 places, 92/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 162 edges and 117 vertex of which 8 / 117 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 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 62 transition count 127
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 62 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 104 place count 62 transition count 124
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 52 transition count 104
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 52 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 131 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 49 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 49 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 46 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 46 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 152 place count 46 transition count 73
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 46 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 45 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 43 transition count 67
Applied a total of 159 rules in 18 ms. Remains 43 /117 variables (removed 74) and now considering 67/231 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 43/117 places, 67/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 76 transition count 150
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 76 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 76 transition count 148
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 70 transition count 136
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 70 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 70 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 68 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 68 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 67 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 67 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 67 transition count 124
Applied a total of 106 rules in 4 ms. Remains 67 /117 variables (removed 50) and now considering 124/231 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 67/117 places, 124/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 9 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 121 edges and 117 vertex of which 10 / 117 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 63 transition count 130
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 63 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 100 place count 63 transition count 127
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 110 place count 53 transition count 107
Iterating global reduction 1 with 10 rules applied. Total rules applied 120 place count 53 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 126 place count 53 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 50 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 47 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 47 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 147 place count 47 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 47 transition count 73
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 155 place count 45 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 43 transition count 69
Applied a total of 157 rules in 14 ms. Remains 43 /117 variables (removed 74) and now considering 69/231 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 43/117 places, 69/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 69 transition count 136
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 69 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 99 place count 69 transition count 133
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 107 place count 61 transition count 117
Iterating global reduction 1 with 8 rules applied. Total rules applied 115 place count 61 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 61 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 59 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 59 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 57 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 57 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 57 transition count 98
Applied a total of 132 rules in 4 ms. Remains 57 /117 variables (removed 60) and now considering 98/231 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 57/117 places, 98/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 6 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 231/231 transitions.
Graph (trivial) has 165 edges and 117 vertex of which 10 / 117 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 63 transition count 130
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 63 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 100 place count 63 transition count 127
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 110 place count 53 transition count 107
Iterating global reduction 1 with 10 rules applied. Total rules applied 120 place count 53 transition count 107
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 127 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 51 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 51 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 49 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 49 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 49 transition count 84
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 49 transition count 80
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 149 place count 47 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 45 transition count 76
Applied a total of 151 rules in 13 ms. Remains 45 /117 variables (removed 72) and now considering 76/231 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 45/117 places, 76/231 transitions.
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 5 ms
[2023-03-13 08:57:59] [INFO ] Input system was already deterministic with 76 transitions.
Incomplete random walk after 10000 steps, including 1006 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 65540 steps, run visited all 1 properties in 79 ms. (steps per millisecond=829 )
Probabilistic random walk after 65540 steps, saw 10891 distinct states, run finished after 79 ms. (steps per millisecond=829 ) properties seen :1
FORMULA HealthRecord-PT-11-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 11 ms
[2023-03-13 08:57:59] [INFO ] Flatten gal took : 12 ms
[2023-03-13 08:57:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 08:57:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 231 transitions and 652 arcs took 2 ms.
Total runtime 17361 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: 117 NrTr: 231 NrArc: 652)

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

net check time: 0m 0.000sec

init dd package: 0m 3.406sec

RS generation: 1m27.236sec

-> reachability set: #nodes 446415 (4.5e+05) #states 162,952,460 (8)

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

checking: AX [AX [[p6<=1 & 1<=p6]]]
normalized: ~ [EX [EX [~ [[p6<=1 & 1<=p6]]]]]

abstracting: (1<=p6)
states: 7,256,160 (6)
abstracting: (p6<=1)
states: 162,952,460 (8)
..-> the formula is FALSE

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

MC time: 0m25.747sec

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

abstracting: (0<=p77)
states: 162,952,460 (8)
abstracting: (p77<=0)
states: 162,940,236 (8)
-> the formula is TRUE

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

MC time: 0m30.584sec

checking: ~ [A [[p108<=1 & 1<=p108] U EG [EF [[p110<=1 & 1<=p110]]]]]
normalized: ~ [[~ [EG [~ [EG [E [true U [p110<=1 & 1<=p110]]]]]] & ~ [E [~ [EG [E [true U [p110<=1 & 1<=p110]]]] U [~ [[p108<=1 & 1<=p108]] & ~ [EG [E [true U [p110<=1 & 1<=p110]]]]]]]]]

abstracting: (1<=p110)
states: 147,744 (5)
abstracting: (p110<=1)
states: 162,952,460 (8)
......
EG iterations: 6
abstracting: (1<=p108)
states: 1
abstracting: (p108<=1)
states: 162,952,460 (8)
abstracting: (1<=p110)
states: 147,744 (5)
abstracting: (p110<=1)
states: 162,952,460 (8)
......
EG iterations: 6
abstracting: (1<=p110)
states: 147,744 (5)
abstracting: (p110<=1)
states: 162,952,460 (8)
......
EG iterations: 6
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m23.383sec

checking: EX [[EF [[[p75<=1 & 1<=p75] & [p89<=1 & 1<=p89]]] & AG [[p113<=0 & 0<=p113]]]]
normalized: EX [[~ [E [true U ~ [[p113<=0 & 0<=p113]]]] & E [true U [[p89<=1 & 1<=p89] & [p75<=1 & 1<=p75]]]]]

abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p89)
states: 155,520 (5)
abstracting: (p89<=1)
states: 162,952,460 (8)
abstracting: (0<=p113)
states: 162,952,460 (8)
abstracting: (p113<=0)
states: 158,180,588 (8)

before gc: list nodes free: 260785

after gc: idd nodes used:970325, unused:63029675; list nodes free:308257647
.-> the formula is FALSE

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

MC time: 1m44.728sec

checking: AG [EF [[EF [[[p26<=1 & 1<=p26] & [p115<=1 & 1<=p115]]] & EG [[[p75<=1 & 1<=p75] & [p86<=1 & 1<=p86]]]]]]
normalized: ~ [E [true U ~ [E [true U [EG [[[p86<=1 & 1<=p86] & [p75<=1 & 1<=p75]]] & E [true U [[p115<=1 & 1<=p115] & [p26<=1 & 1<=p26]]]]]]]]

abstracting: (1<=p26)
states: 7,196,544 (6)
abstracting: (p26<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p86)
states: 155,520 (5)
abstracting: (p86<=1)
states: 162,952,460 (8)
.....
EG iterations: 5
-> the formula is FALSE

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

MC time: 0m45.229sec

checking: ~ [E [[~ [[EF [~ [[p5<=1 & 1<=p5]]] & EF [[p12<=1 & 1<=p12]]]] | [[p63<=1 & 1<=p63] | AX [~ [[p4<=1 & 1<=p4]]]]] U [[p34<=1 & 1<=p34] & [p115<=1 & 1<=p115]]]]
normalized: ~ [E [[[~ [EX [[p4<=1 & 1<=p4]]] | [p63<=1 & 1<=p63]] | ~ [[E [true U [p12<=1 & 1<=p12]] & E [true U ~ [[p5<=1 & 1<=p5]]]]]] U [[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]

abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p5)
states: 7,948,320 (6)
abstracting: (p5<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p63)
states: 1,422,624 (6)
abstracting: (p63<=1)
states: 162,952,460 (8)
abstracting: (1<=p4)
states: 14,791,776 (7)
abstracting: (p4<=1)
states: 162,952,460 (8)
.-> the formula is FALSE

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

MC time: 1m11.703sec

checking: AG [[AG [[p22<=0 & 0<=p22]] | [EG [EF [[[p34<=0 & 0<=p34] | [p115<=0 & 0<=p115]]]] | EF [[[[p12<=0 & 0<=p12] | [p23<=0 & 0<=p23]] | [[p34<=0 & 0<=p34] | [p105<=0 & 0<=p105]]]]]]]
normalized: ~ [E [true U ~ [[[E [true U [[[p105<=0 & 0<=p105] | [p34<=0 & 0<=p34]] | [[p23<=0 & 0<=p23] | [p12<=0 & 0<=p12]]]] | EG [E [true U [[p115<=0 & 0<=p115] | [p34<=0 & 0<=p34]]]]] | ~ [E [true U ~ [[p22<=0 & 0<=p22]]]]]]]]

abstracting: (0<=p22)
states: 162,952,460 (8)
abstracting: (p22<=0)
states: 146,719,132 (8)

before gc: list nodes free: 27611572

after gc: idd nodes used:937614, unused:63062386; list nodes free:308366932
abstracting: (0<=p34)
states: 162,952,460 (8)
abstracting: (p34<=0)
states: 137,119,948 (8)
abstracting: (0<=p115)
states: 162,952,460 (8)
abstracting: (p115<=0)
states: 153,707,132 (8)

EG iterations: 0
abstracting: (0<=p12)
states: 162,952,460 (8)
abstracting: (p12<=0)
states: 140,226,012 (8)
abstracting: (0<=p23)
states: 162,952,460 (8)
abstracting: (p23<=0)
states: 138,566,124 (8)
abstracting: (0<=p34)
states: 162,952,460 (8)
abstracting: (p34<=0)
states: 137,119,948 (8)
abstracting: (0<=p105)
states: 162,952,460 (8)
abstracting: (p105<=0)
states: 157,947,308 (8)
-> the formula is TRUE

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

MC time: 1m33.304sec

checking: EF [[EF [AG [[A [[1<=p10 & p10<=1] U [p78<=1 & 1<=p78]] | AX [[p57<=1 & 1<=p57]]]]] & [[AX [[p25<=1 & 1<=p25]] | [E [~ [[p107<=1 & 1<=p107]] U EF [[p23<=1 & 1<=p23]]] & [p68<=1 & 1<=p68]]] & [[p4<=1 & 1<=p4] | EF [[p29<=0 & 0<=p29]]]]]]
normalized: E [true U [[[E [true U [p29<=0 & 0<=p29]] | [p4<=1 & 1<=p4]] & [[[p68<=1 & 1<=p68] & E [~ [[p107<=1 & 1<=p107]] U E [true U [p23<=1 & 1<=p23]]]] | ~ [EX [~ [[p25<=1 & 1<=p25]]]]]] & E [true U ~ [E [true U ~ [[~ [EX [~ [[p57<=1 & 1<=p57]]]] | [~ [EG [~ [[p78<=1 & 1<=p78]]]] & ~ [E [~ [[p78<=1 & 1<=p78]] U [~ [[1<=p10 & p10<=1]] & ~ [[p78<=1 & 1<=p78]]]]]]]]]]]]]

abstracting: (1<=p78)
states: 3,669,120 (6)
abstracting: (p78<=1)
states: 162,952,460 (8)
abstracting: (p10<=1)
states: 162,952,460 (8)
abstracting: (1<=p10)
states: 14,867,424 (7)
abstracting: (1<=p78)
states: 3,669,120 (6)
abstracting: (p78<=1)
states: 162,952,460 (8)
abstracting: (1<=p78)
states: 3,669,120 (6)
abstracting: (p78<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p57)
states: 25,774,032 (7)
abstracting: (p57<=1)
states: 162,952,460 (8)
.abstracting: (1<=p25)
states: 6,971,760 (6)
abstracting: (p25<=1)
states: 162,952,460 (8)

before gc: list nodes free: 232876

after gc: idd nodes used:1876510, unused:62123490; list nodes free:303759086
.abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p107)
states: 1
abstracting: (p107<=1)
states: 162,952,460 (8)
abstracting: (1<=p68)
states: 4,416,576 (6)
abstracting: (p68<=1)
states: 162,952,460 (8)
abstracting: (1<=p4)
states: 14,791,776 (7)
abstracting: (p4<=1)
states: 162,952,460 (8)
abstracting: (0<=p29)
states: 162,952,460 (8)
abstracting: (p29<=0)
states: 155,004,140 (8)

before gc: list nodes free: 15676347

after gc: idd nodes used:1374266, unused:62625734; list nodes free:306483710
MC time: 7m17.132sec

checking: E [AG [~ [AX [A [[p72<=1 & 1<=p72] U [p66<=1 & 1<=p66]]]]] U [[AF [[p68<=1 & 1<=p68]] | AF [[EF [AG [[p101<=1 & 1<=p101]]] & A [AG [[p60<=1 & 1<=p60]] U [[p4<=1 & 1<=p4] | [p109<=1 & 1<=p109]]]]]] | [[p46<=1 & 1<=p46] | [p96<=1 & 1<=p96]]]]
normalized: E [~ [E [true U ~ [EX [~ [[~ [EG [~ [[p66<=1 & 1<=p66]]]] & ~ [E [~ [[p66<=1 & 1<=p66]] U [~ [[p72<=1 & 1<=p72]] & ~ [[p66<=1 & 1<=p66]]]]]]]]]]] U [[[p96<=1 & 1<=p96] | [p46<=1 & 1<=p46]] | [~ [EG [~ [[[~ [EG [~ [[[p109<=1 & 1<=p109] | [p4<=1 & 1<=p4]]]]] & ~ [E [~ [[[p109<=1 & 1<=p109] | [p4<=1 & 1<=p4]]] U [E [true U ~ [[p60<=1 & 1<=p60]]] & ~ [[[p109<=1 & 1<=p109] | [p4<=1 & 1<=p4]]]]]]] & E [true U ~ [E [true U ~ [[p101<=1 & 1<=p101]]]]]]]]] | ~ [EG [~ [[p68<=1 & 1<=p68]]]]]]]

abstracting: (1<=p68)
states: 4,416,576 (6)
abstracting: (p68<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p101)
states: 2,236,912 (6)
abstracting: (p101<=1)
states: 162,952,460 (8)
abstracting: (1<=p4)
states: 14,791,776 (7)
abstracting: (p4<=1)
states: 162,952,460 (8)
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
abstracting: (1<=p60)
states: 33,545,216 (7)
abstracting: (p60<=1)
states: 162,952,460 (8)
abstracting: (1<=p4)
states: 14,791,776 (7)
abstracting: (p4<=1)
states: 162,952,460 (8)
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
abstracting: (1<=p4)
states: 14,791,776 (7)
abstracting: (p4<=1)
states: 162,952,460 (8)
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p46)
states: 21,683,296 (7)
abstracting: (p46<=1)
states: 162,952,460 (8)
abstracting: (1<=p96)
states: 155,520 (5)
abstracting: (p96<=1)
states: 162,952,460 (8)
abstracting: (1<=p66)
states: 18,053,120 (7)
abstracting: (p66<=1)
states: 162,952,460 (8)
abstracting: (1<=p72)
states: 1
abstracting: (p72<=1)
states: 162,952,460 (8)
abstracting: (1<=p66)
states: 18,053,120 (7)
abstracting: (p66<=1)
states: 162,952,460 (8)
abstracting: (1<=p66)
states: 18,053,120 (7)
abstracting: (p66<=1)
states: 162,952,460 (8)
.
EG iterations: 1
.
before gc: list nodes free: 1738268

after gc: idd nodes used:1291585, unused:62708415; list nodes free:317259402
-> the formula is FALSE

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

MC time: 3m58.256sec

checking: EF [[[[p33<=1 & 1<=p33] & ~ [[p109<=1 & 1<=p109]]] & [EX [EX [AG [[p57<=1 & 1<=p57]]]] & [[~ [[p34<=1 & 1<=p34]] | ~ [[p115<=1 & 1<=p115]]] & [[AG [[p8<=0 & 0<=p8]] | [p57<=0 & 0<=p57]] | [[p19<=0 & 0<=p19] | [[[p75<=0 & 0<=p75] | [p103<=0 & 0<=p103]] & [[p54<=0 & 0<=p54] | [p115<=0 & 0<=p115]]]]]]]]]
normalized: E [true U [[[[[[[[p115<=0 & 0<=p115] | [p54<=0 & 0<=p54]] & [[p103<=0 & 0<=p103] | [p75<=0 & 0<=p75]]] | [p19<=0 & 0<=p19]] | [[p57<=0 & 0<=p57] | ~ [E [true U ~ [[p8<=0 & 0<=p8]]]]]] & [~ [[p115<=1 & 1<=p115]] | ~ [[p34<=1 & 1<=p34]]]] & EX [EX [~ [E [true U ~ [[p57<=1 & 1<=p57]]]]]]] & [~ [[p109<=1 & 1<=p109]] & [p33<=1 & 1<=p33]]]]

abstracting: (1<=p33)
states: 7,186,560 (6)
abstracting: (p33<=1)
states: 162,952,460 (8)
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
abstracting: (1<=p57)
states: 25,774,032 (7)
abstracting: (p57<=1)
states: 162,952,460 (8)
..abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (0<=p8)
states: 162,952,460 (8)
abstracting: (p8<=0)
states: 154,010,636 (8)
abstracting: (0<=p57)
states: 162,952,460 (8)
abstracting: (p57<=0)
states: 137,178,428 (8)
abstracting: (0<=p19)
states: 162,952,460 (8)
abstracting: (p19<=0)
states: 154,849,772 (8)
abstracting: (0<=p75)
states: 162,952,460 (8)
abstracting: (p75<=0)
states: 129,379,420 (8)
abstracting: (0<=p103)
states: 162,952,460 (8)
abstracting: (p103<=0)
states: 154,907,756 (8)
abstracting: (0<=p54)
states: 162,952,460 (8)
abstracting: (p54<=0)
states: 121,675,836 (8)
abstracting: (0<=p115)
states: 162,952,460 (8)
abstracting: (p115<=0)
states: 153,707,132 (8)
-> the formula is FALSE

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

MC time: 0m38.886sec

checking: EG [E [[AF [[p23<=1 & 1<=p23]] | [[p12<=1 & 1<=p12] | [[EF [[p100<=1 & 1<=p100]] & EF [[[p75<=1 & 1<=p75] & [p103<=1 & 1<=p103]]]] & [~ [[[p6<=1 & 1<=p6] | [[[p12<=1 & 1<=p12] & [p23<=1 & 1<=p23]] & [[p34<=1 & 1<=p34] & [p115<=1 & 1<=p115]]]]] & ~ [[p61<=1 & 1<=p61]]]]]] U [[[p75<=1 & 1<=p75] & [p79<=1 & 1<=p79]] & [[p57<=1 & 1<=p57] & [[p23<=1 & 1<=p23] & [EG [[p36<=1 & 1<=p36]] | [[p7<=1 & 1<=p7] | [p102<=1 & 1<=p102]]]]]]]]
normalized: EG [E [[[[[~ [[p61<=1 & 1<=p61]] & ~ [[[[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]] & [[p23<=1 & 1<=p23] & [p12<=1 & 1<=p12]]] | [p6<=1 & 1<=p6]]]] & [E [true U [[p103<=1 & 1<=p103] & [p75<=1 & 1<=p75]]] & E [true U [p100<=1 & 1<=p100]]]] | [p12<=1 & 1<=p12]] | ~ [EG [~ [[p23<=1 & 1<=p23]]]]] U [[[[[[p102<=1 & 1<=p102] | [p7<=1 & 1<=p7]] | EG [[p36<=1 & 1<=p36]]] & [p23<=1 & 1<=p23]] & [p57<=1 & 1<=p57]] & [[p79<=1 & 1<=p79] & [p75<=1 & 1<=p75]]]]]

abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p79)
states: 8,011,008 (6)
abstracting: (p79<=1)
states: 162,952,460 (8)
abstracting: (1<=p57)
states: 25,774,032 (7)
abstracting: (p57<=1)
states: 162,952,460 (8)
abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p36)
states: 7,657,728 (6)
abstracting: (p36<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p7)
states: 7,740,576 (6)
abstracting: (p7<=1)
states: 162,952,460 (8)
abstracting: (1<=p102)
states: 3,669,120 (6)
abstracting: (p102<=1)
states: 162,952,460 (8)
abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p100)
states: 1,308,672 (6)
abstracting: (p100<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p103)
states: 8,044,704 (6)
abstracting: (p103<=1)
states: 162,952,460 (8)

before gc: list nodes free: 21539018

after gc: idd nodes used:2311983, unused:61688017; list nodes free:312859448
abstracting: (1<=p6)
states: 7,256,160 (6)
abstracting: (p6<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p61)
states: 18,001,280 (7)
abstracting: (p61<=1)
states: 162,952,460 (8)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 2m30.166sec

checking: A [[AF [[p20<=1 & 1<=p20]] | A [[p29<=1 & 1<=p29] U [[AX [[p51<=1 & 1<=p51]] | E [[[p75<=1 & 1<=p75] & [p81<=1 & 1<=p81]] U [p64<=1 & 1<=p64]]] | [A [[[p75<=1 & 1<=p75] & [p97<=1 & 1<=p97]] U [p92<=1 & 1<=p92]] | [[p109<=1 & 1<=p109] | ~ [[p46<=1 & 1<=p46]]]]]]] U [E [A [AX [[p45<=1 & 1<=p45]] U EG [[p22<=1 & 1<=p22]]] U [~ [EF [[[p75<=1 & 1<=p75] & [p82<=1 & 1<=p82]]]] | AG [E [[p93<=1 & 1<=p93] U [p85<=1 & 1<=p85]]]]] | [[p28<=1 & 1<=p28] & [[p12<=1 & 1<=p12] & [p115<=1 & 1<=p115]]]]]
normalized: [~ [EG [~ [[[[[p115<=1 & 1<=p115] & [p12<=1 & 1<=p12]] & [p28<=1 & 1<=p28]] | E [[~ [EG [~ [EG [[p22<=1 & 1<=p22]]]]] & ~ [E [~ [EG [[p22<=1 & 1<=p22]]] U [EX [~ [[p45<=1 & 1<=p45]]] & ~ [EG [[p22<=1 & 1<=p22]]]]]]] U [~ [E [true U ~ [E [[p93<=1 & 1<=p93] U [p85<=1 & 1<=p85]]]]] | ~ [E [true U [[p82<=1 & 1<=p82] & [p75<=1 & 1<=p75]]]]]]]]]] & ~ [E [~ [[[[[p115<=1 & 1<=p115] & [p12<=1 & 1<=p12]] & [p28<=1 & 1<=p28]] | E [[~ [EG [~ [EG [[p22<=1 & 1<=p22]]]]] & ~ [E [~ [EG [[p22<=1 & 1<=p22]]] U [EX [~ [[p45<=1 & 1<=p45]]] & ~ [EG [[p22<=1 & 1<=p22]]]]]]] U [~ [E [true U ~ [E [[p93<=1 & 1<=p93] U [p85<=1 & 1<=p85]]]]] | ~ [E [true U [[p82<=1 & 1<=p82] & [p75<=1 & 1<=p75]]]]]]]] U [~ [[[~ [EG [~ [[[[~ [[p46<=1 & 1<=p46]] | [p109<=1 & 1<=p109]] | [~ [EG [~ [[p92<=1 & 1<=p92]]]] & ~ [E [~ [[p92<=1 & 1<=p92]] U [~ [[[p97<=1 & 1<=p97] & [p75<=1 & 1<=p75]]] & ~ [[p92<=1 & 1<=p92]]]]]]] | [E [[[p81<=1 & 1<=p81] & [p75<=1 & 1<=p75]] U [p64<=1 & 1<=p64]] | ~ [EX [~ [[p51<=1 & 1<=p51]]]]]]]]] & ~ [E [~ [[[[~ [[p46<=1 & 1<=p46]] | [p109<=1 & 1<=p109]] | [~ [EG [~ [[p92<=1 & 1<=p92]]]] & ~ [E [~ [[p92<=1 & 1<=p92]] U [~ [[[p97<=1 & 1<=p97] & [p75<=1 & 1<=p75]]] & ~ [[p92<=1 & 1<=p92]]]]]]] | [E [[[p81<=1 & 1<=p81] & [p75<=1 & 1<=p75]] U [p64<=1 & 1<=p64]] | ~ [EX [~ [[p51<=1 & 1<=p51]]]]]]] U [~ [[p29<=1 & 1<=p29]] & ~ [[[[~ [[p46<=1 & 1<=p46]] | [p109<=1 & 1<=p109]] | [~ [EG [~ [[p92<=1 & 1<=p92]]]] & ~ [E [~ [[p92<=1 & 1<=p92]] U [~ [[[p97<=1 & 1<=p97] & [p75<=1 & 1<=p75]]] & ~ [[p92<=1 & 1<=p92]]]]]]] | [E [[[p81<=1 & 1<=p81] & [p75<=1 & 1<=p75]] U [p64<=1 & 1<=p64]] | ~ [EX [~ [[p51<=1 & 1<=p51]]]]]]]]]]] | ~ [EG [~ [[p20<=1 & 1<=p20]]]]]] & ~ [[[[[p115<=1 & 1<=p115] & [p12<=1 & 1<=p12]] & [p28<=1 & 1<=p28]] | E [[~ [EG [~ [EG [[p22<=1 & 1<=p22]]]]] & ~ [E [~ [EG [[p22<=1 & 1<=p22]]] U [EX [~ [[p45<=1 & 1<=p45]]] & ~ [EG [[p22<=1 & 1<=p22]]]]]]] U [~ [E [true U ~ [E [[p93<=1 & 1<=p93] U [p85<=1 & 1<=p85]]]]] | ~ [E [true U [[p82<=1 & 1<=p82] & [p75<=1 & 1<=p75]]]]]]]]]]]]

abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p82)
states: 8,011,008 (6)
abstracting: (p82<=1)
states: 162,952,460 (8)
abstracting: (1<=p85)
states: 155,520 (5)
abstracting: (p85<=1)
states: 162,952,460 (8)
abstracting: (1<=p93)
states: 155,520 (5)
abstracting: (p93<=1)
states: 162,952,460 (8)
abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p45)
states: 11
abstracting: (p45<=1)
states: 162,952,460 (8)
.abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
.
EG iterations: 1
abstracting: (1<=p28)
states: 16,654,272 (7)
abstracting: (p28<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p20)
states: 16,233,328 (7)
abstracting: (p20<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p51)
states: 29,409,216 (7)
abstracting: (p51<=1)
states: 162,952,460 (8)
.abstracting: (1<=p64)
states: 1,242,144 (6)
abstracting: (p64<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p81)
states: 8,074,656 (6)
abstracting: (p81<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p97)
states: 155,520 (5)
abstracting: (p97<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
abstracting: (1<=p46)
states: 21,683,296 (7)
abstracting: (p46<=1)
states: 162,952,460 (8)
abstracting: (1<=p29)
states: 7,948,320 (6)
abstracting: (p29<=1)
states: 162,952,460 (8)
abstracting: (1<=p51)
states: 29,409,216 (7)
abstracting: (p51<=1)
states: 162,952,460 (8)
.abstracting: (1<=p64)
states: 1,242,144 (6)
abstracting: (p64<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p81)
states: 8,074,656 (6)
abstracting: (p81<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p97)
states: 155,520 (5)
abstracting: (p97<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
abstracting: (1<=p46)
states: 21,683,296 (7)
abstracting: (p46<=1)
states: 162,952,460 (8)
abstracting: (1<=p51)
states: 29,409,216 (7)
abstracting: (p51<=1)
states: 162,952,460 (8)
.abstracting: (1<=p64)
states: 1,242,144 (6)
abstracting: (p64<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p81)
states: 8,074,656 (6)
abstracting: (p81<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p97)
states: 155,520 (5)
abstracting: (p97<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p109)
states: 1
abstracting: (p109<=1)
states: 162,952,460 (8)
abstracting: (1<=p46)
states: 21,683,296 (7)
abstracting: (p46<=1)
states: 162,952,460 (8)

before gc: list nodes free: 19290491

after gc: idd nodes used:2708188, unused:61291812; list nodes free:310806919
........
EG iterations: 8
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p82)
states: 8,011,008 (6)
abstracting: (p82<=1)
states: 162,952,460 (8)
abstracting: (1<=p85)
states: 155,520 (5)
abstracting: (p85<=1)
states: 162,952,460 (8)
abstracting: (1<=p93)
states: 155,520 (5)
abstracting: (p93<=1)
states: 162,952,460 (8)
abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p45)
states: 11
abstracting: (p45<=1)
states: 162,952,460 (8)
.abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
.
EG iterations: 1
abstracting: (1<=p28)
states: 16,654,272 (7)
abstracting: (p28<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p82)
states: 8,011,008 (6)
abstracting: (p82<=1)
states: 162,952,460 (8)
abstracting: (1<=p85)
states: 155,520 (5)
abstracting: (p85<=1)
states: 162,952,460 (8)
abstracting: (1<=p93)
states: 155,520 (5)
abstracting: (p93<=1)
states: 162,952,460 (8)
abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p45)
states: 11
abstracting: (p45<=1)
states: 162,952,460 (8)
.abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
abstracting: (1<=p22)
states: 16,233,328 (7)
abstracting: (p22<=1)
states: 162,952,460 (8)
.........
EG iterations: 9
.
EG iterations: 1
abstracting: (1<=p28)
states: 16,654,272 (7)
abstracting: (p28<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)

before gc: list nodes free: 21872898

after gc: idd nodes used:2858065, unused:61141935; list nodes free:310352884
......
EG iterations: 6
-> the formula is FALSE

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

MC time: 8m37.848sec

checking: E [[[EG [A [[p85<=1 & 1<=p85] U [p67<=1 & 1<=p67]]] | [p81<=1 & 1<=p81]] | [A [EG [A [[p23<=1 & 1<=p23] U [p45<=1 & 1<=p45]]] U [[EX [[p7<=1 & 1<=p7]] | A [[p42<=1 & 1<=p42] U [[p34<=1 & 1<=p34] & [p115<=1 & 1<=p115]]]] | [[EG [[p84<=1 & 1<=p84]] & ~ [[p66<=1 & 1<=p66]]] | [~ [[p69<=1 & 1<=p69]] | [[p18<=1 & 1<=p18] & ~ [[p47<=1 & 1<=p47]]]]]]] | [[EF [[p37<=1 & 1<=p37]] & [~ [[[p32<=1 & 1<=p32] | [p107<=1 & 1<=p107]]] & [p12<=1 & 1<=p12]]] & [[p23<=1 & 1<=p23] & [[p34<=1 & 1<=p34] & [p94<=1 & 1<=p94]]]]]] U AG [~ [EF [[p44<=1 & 1<=p44]]]]]
normalized: E [[[[~ [EG [~ [[[[[~ [[p47<=1 & 1<=p47]] & [p18<=1 & 1<=p18]] | ~ [[p69<=1 & 1<=p69]]] | [~ [[p66<=1 & 1<=p66]] & EG [[p84<=1 & 1<=p84]]]] | [[~ [EG [~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]] & ~ [E [~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]] U [~ [[p42<=1 & 1<=p42]] & ~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]]]] | EX [[p7<=1 & 1<=p7]]]]]]] & ~ [E [~ [[[[[~ [[p47<=1 & 1<=p47]] & [p18<=1 & 1<=p18]] | ~ [[p69<=1 & 1<=p69]]] | [~ [[p66<=1 & 1<=p66]] & EG [[p84<=1 & 1<=p84]]]] | [[~ [EG [~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]] & ~ [E [~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]] U [~ [[p42<=1 & 1<=p42]] & ~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]]]] | EX [[p7<=1 & 1<=p7]]]]] U [~ [[[[[~ [[p47<=1 & 1<=p47]] & [p18<=1 & 1<=p18]] | ~ [[p69<=1 & 1<=p69]]] | [~ [[p66<=1 & 1<=p66]] & EG [[p84<=1 & 1<=p84]]]] | [[~ [EG [~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]] & ~ [E [~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]] U [~ [[p42<=1 & 1<=p42]] & ~ [[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]]]]]]] | EX [[p7<=1 & 1<=p7]]]]] & ~ [EG [[~ [EG [~ [[p45<=1 & 1<=p45]]]] & ~ [E [~ [[p45<=1 & 1<=p45]] U [~ [[p23<=1 & 1<=p23]] & ~ [[p45<=1 & 1<=p45]]]]]]]]]]]] | [[[[p94<=1 & 1<=p94] & [p34<=1 & 1<=p34]] & [p23<=1 & 1<=p23]] & [[[p12<=1 & 1<=p12] & ~ [[[p107<=1 & 1<=p107] | [p32<=1 & 1<=p32]]]] & E [true U [p37<=1 & 1<=p37]]]]] | [[p81<=1 & 1<=p81] | EG [[~ [EG [~ [[p67<=1 & 1<=p67]]]] & ~ [E [~ [[p67<=1 & 1<=p67]] U [~ [[p85<=1 & 1<=p85]] & ~ [[p67<=1 & 1<=p67]]]]]]]]] U ~ [E [true U E [true U [p44<=1 & 1<=p44]]]]]

abstracting: (1<=p44)
states: 40,738,112 (7)
abstracting: (p44<=1)
states: 162,952,460 (8)
abstracting: (1<=p67)
states: 7,084,448 (6)
abstracting: (p67<=1)
states: 162,952,460 (8)
abstracting: (1<=p85)
states: 155,520 (5)
abstracting: (p85<=1)
states: 162,952,460 (8)
abstracting: (1<=p67)
states: 7,084,448 (6)
abstracting: (p67<=1)
states: 162,952,460 (8)
abstracting: (1<=p67)
states: 7,084,448 (6)
abstracting: (p67<=1)
states: 162,952,460 (8)
.
EG iterations: 1
.........
EG iterations: 9
abstracting: (1<=p81)
states: 8,074,656 (6)
abstracting: (p81<=1)
states: 162,952,460 (8)
abstracting: (1<=p37)
states: 40,738,112 (7)
abstracting: (p37<=1)
states: 162,952,460 (8)
abstracting: (1<=p32)
states: 16,741,440 (7)
abstracting: (p32<=1)
states: 162,952,460 (8)
abstracting: (1<=p107)
states: 1
abstracting: (p107<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p94)
states: 3,669,120 (6)
abstracting: (p94<=1)
states: 162,952,460 (8)
abstracting: (1<=p45)
states: 11
abstracting: (p45<=1)
states: 162,952,460 (8)
abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p45)
states: 11
abstracting: (p45<=1)
states: 162,952,460 (8)
abstracting: (1<=p45)
states: 11
abstracting: (p45<=1)
states: 162,952,460 (8)
...
EG iterations: 3
.
EG iterations: 1
abstracting: (1<=p7)
states: 7,740,576 (6)
abstracting: (p7<=1)
states: 162,952,460 (8)
.abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p42)
states: 40,738,112 (7)
abstracting: (p42<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p84)
states: 491,616 (5)
abstracting: (p84<=1)
states: 162,952,460 (8)
......
EG iterations: 6
abstracting: (1<=p66)
states: 18,053,120 (7)
abstracting: (p66<=1)
states: 162,952,460 (8)
abstracting: (1<=p69)
states: 1
abstracting: (p69<=1)
states: 162,952,460 (8)
abstracting: (1<=p18)
states: 6,959,232 (6)
abstracting: (p18<=1)
states: 162,952,460 (8)
abstracting: (1<=p47)
states: 21,800,448 (7)
abstracting: (p47<=1)
states: 162,952,460 (8)
abstracting: (1<=p7)
states: 7,740,576 (6)
abstracting: (p7<=1)
states: 162,952,460 (8)
.abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p42)
states: 40,738,112 (7)
abstracting: (p42<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p84)
states: 491,616 (5)
abstracting: (p84<=1)
states: 162,952,460 (8)
......
EG iterations: 6
abstracting: (1<=p66)
states: 18,053,120 (7)
abstracting: (p66<=1)
states: 162,952,460 (8)
abstracting: (1<=p69)
states: 1
abstracting: (p69<=1)
states: 162,952,460 (8)
abstracting: (1<=p18)
states: 6,959,232 (6)
abstracting: (p18<=1)
states: 162,952,460 (8)
abstracting: (1<=p47)
states: 21,800,448 (7)
abstracting: (p47<=1)
states: 162,952,460 (8)
abstracting: (1<=p7)
states: 7,740,576 (6)
abstracting: (p7<=1)
states: 162,952,460 (8)
.abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p42)
states: 40,738,112 (7)
abstracting: (p42<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
.
EG iterations: 1
abstracting: (1<=p84)
states: 491,616 (5)
abstracting: (p84<=1)
states: 162,952,460 (8)
......
EG iterations: 6
abstracting: (1<=p66)
states: 18,053,120 (7)
abstracting: (p66<=1)
states: 162,952,460 (8)
abstracting: (1<=p69)
states: 1
abstracting: (p69<=1)
states: 162,952,460 (8)
abstracting: (1<=p18)
states: 6,959,232 (6)
abstracting: (p18<=1)
states: 162,952,460 (8)
abstracting: (1<=p47)
states: 21,800,448 (7)
abstracting: (p47<=1)
states: 162,952,460 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 3m47.598sec

checking: E [[EG [EX [~ [[[p75<=1 & 1<=p75] & [p91<=1 & 1<=p91]]]]] | [EX [EX [[[p17<=1 & 1<=p17] & [[p34<=1 & 1<=p34] & [p115<=1 & 1<=p115]]]]] & [[[~ [[p11<=1 & 1<=p11]] | [p65<=1 & 1<=p65]] | [[EF [[p104<=1 & 1<=p104]] & [[p75<=1 & 1<=p75] & [p84<=1 & 1<=p84]]] | [~ [[p12<=1 & 1<=p12]] & [[p21<=1 & 1<=p21] | [p20<=1 & 1<=p20]]]]] & [[p53<=1 & 1<=p53] | [[p75<=1 & 1<=p75] & [p103<=1 & 1<=p103]]]]]] U AG [[[~ [[[[p51<=1 & 1<=p51] & [p83<=1 & 1<=p83]] & [[p92<=1 & 1<=p92] & [[p75<=1 & 1<=p75] & [p84<=1 & 1<=p84]]]]] & [p23<=1 & 1<=p23]] & [[p115<=1 & 1<=p115] & [[p102<=1 & 1<=p102] | EF [[p31<=1 & 1<=p31]]]]]]]
normalized: E [[[[[[[p103<=1 & 1<=p103] & [p75<=1 & 1<=p75]] | [p53<=1 & 1<=p53]] & [[[[[p20<=1 & 1<=p20] | [p21<=1 & 1<=p21]] & ~ [[p12<=1 & 1<=p12]]] | [[[p84<=1 & 1<=p84] & [p75<=1 & 1<=p75]] & E [true U [p104<=1 & 1<=p104]]]] | [[p65<=1 & 1<=p65] | ~ [[p11<=1 & 1<=p11]]]]] & EX [EX [[[[p115<=1 & 1<=p115] & [p34<=1 & 1<=p34]] & [p17<=1 & 1<=p17]]]]] | EG [EX [~ [[[p91<=1 & 1<=p91] & [p75<=1 & 1<=p75]]]]]] U ~ [E [true U ~ [[[[E [true U [p31<=1 & 1<=p31]] | [p102<=1 & 1<=p102]] & [p115<=1 & 1<=p115]] & [[p23<=1 & 1<=p23] & ~ [[[[[p84<=1 & 1<=p84] & [p75<=1 & 1<=p75]] & [p92<=1 & 1<=p92]] & [[p83<=1 & 1<=p83] & [p51<=1 & 1<=p51]]]]]]]]]]

abstracting: (1<=p51)
states: 29,409,216 (7)
abstracting: (p51<=1)
states: 162,952,460 (8)
abstracting: (1<=p83)
states: 155,520 (5)
abstracting: (p83<=1)
states: 162,952,460 (8)
abstracting: (1<=p92)
states: 155,520 (5)
abstracting: (p92<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p84)
states: 491,616 (5)
abstracting: (p84<=1)
states: 162,952,460 (8)
abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
abstracting: (1<=p102)
states: 3,669,120 (6)
abstracting: (p102<=1)
states: 162,952,460 (8)
abstracting: (1<=p31)
states: 16,741,440 (7)
abstracting: (p31<=1)
states: 162,952,460 (8)

before gc: list nodes free: 9164722

after gc: idd nodes used:3111422, unused:60888578; list nodes free:309376702
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p91)
states: 8,011,008 (6)
abstracting: (p91<=1)
states: 162,952,460 (8)
.........
EG iterations: 8
abstracting: (1<=p17)
states: 16,146,160 (7)
abstracting: (p17<=1)
states: 162,952,460 (8)
abstracting: (1<=p34)
states: 25,832,512 (7)
abstracting: (p34<=1)
states: 162,952,460 (8)
abstracting: (1<=p115)
states: 9,245,328 (6)
abstracting: (p115<=1)
states: 162,952,460 (8)
..abstracting: (1<=p11)
states: 15,224,336 (7)
abstracting: (p11<=1)
states: 162,952,460 (8)
abstracting: (1<=p65)
states: 18,055,040 (7)
abstracting: (p65<=1)
states: 162,952,460 (8)
abstracting: (1<=p104)
states: 147,744 (5)
abstracting: (p104<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p84)
states: 491,616 (5)
abstracting: (p84<=1)
states: 162,952,460 (8)
abstracting: (1<=p12)
states: 22,726,448 (7)
abstracting: (p12<=1)
states: 162,952,460 (8)
abstracting: (1<=p21)
states: 16,233,328 (7)
abstracting: (p21<=1)
states: 162,952,460 (8)
abstracting: (1<=p20)
states: 16,233,328 (7)
abstracting: (p20<=1)
states: 162,952,460 (8)
abstracting: (1<=p53)
states: 39,729,440 (7)
abstracting: (p53<=1)
states: 162,952,460 (8)
abstracting: (1<=p75)
states: 33,573,040 (7)
abstracting: (p75<=1)
states: 162,952,460 (8)
abstracting: (1<=p103)
states: 8,044,704 (6)
abstracting: (p103<=1)
states: 162,952,460 (8)
-> the formula is FALSE

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

MC time: 3m46.979sec

checking: EF [[EF [AG [[A [[1<=p10 & p10<=1] U [p78<=1 & 1<=p78]] | AX [[p57<=1 & 1<=p57]]]]] & [[AX [[p25<=1 & 1<=p25]] | [E [~ [[p107<=1 & 1<=p107]] U EF [[p23<=1 & 1<=p23]]] & [p68<=1 & 1<=p68]]] & [[p4<=1 & 1<=p4] | EF [[p29<=0 & 0<=p29]]]]]]
normalized: E [true U [[[E [true U [p29<=0 & 0<=p29]] | [p4<=1 & 1<=p4]] & [[[p68<=1 & 1<=p68] & E [~ [[p107<=1 & 1<=p107]] U E [true U [p23<=1 & 1<=p23]]]] | ~ [EX [~ [[p25<=1 & 1<=p25]]]]]] & E [true U ~ [E [true U ~ [[~ [EX [~ [[p57<=1 & 1<=p57]]]] | [~ [EG [~ [[p78<=1 & 1<=p78]]]] & ~ [E [~ [[p78<=1 & 1<=p78]] U [~ [[1<=p10 & p10<=1]] & ~ [[p78<=1 & 1<=p78]]]]]]]]]]]]]

abstracting: (1<=p78)
states: 3,669,120 (6)
abstracting: (p78<=1)
states: 162,952,460 (8)
abstracting: (p10<=1)
states: 162,952,460 (8)
abstracting: (1<=p10)
states: 14,867,424 (7)
abstracting: (1<=p78)
states: 3,669,120 (6)
abstracting: (p78<=1)
states: 162,952,460 (8)
abstracting: (1<=p78)
states: 3,669,120 (6)
abstracting: (p78<=1)
states: 162,952,460 (8)

before gc: list nodes free: 17595278

after gc: idd nodes used:4279153, unused:59720847; list nodes free:303405520
.
EG iterations: 1
abstracting: (1<=p57)
states: 25,774,032 (7)
abstracting: (p57<=1)
states: 162,952,460 (8)
.abstracting: (1<=p25)
states: 6,971,760 (6)
abstracting: (p25<=1)
states: 162,952,460 (8)
.abstracting: (1<=p23)
states: 24,386,336 (7)
abstracting: (p23<=1)
states: 162,952,460 (8)
abstracting: (1<=p107)
states: 1
abstracting: (p107<=1)
states: 162,952,460 (8)
abstracting: (1<=p68)
states: 4,416,576 (6)
abstracting: (p68<=1)
states: 162,952,460 (8)
abstracting: (1<=p4)
states: 14,791,776 (7)
abstracting: (p4<=1)
states: 162,952,460 (8)
abstracting: (0<=p29)
states: 162,952,460 (8)
abstracting: (p29<=0)
states: 155,004,140 (8)

before gc: list nodes free: 8182110

after gc: idd nodes used:3462455, unused:60537545; list nodes free:307828980
-> the formula is TRUE

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

MC time: 8m52.152sec

totally nodes used: 735062366 (7.4e+08)
number of garbage collections: 11
fire ops cache: hits/miss/sum: 540390352 2238702743 2779093095
used/not used/entry size/cache size: 62899855 4209009 16 1024MB
basic ops cache: hits/miss/sum: 206843724 915319987 1122163711
used/not used/entry size/cache size: 16745171 32045 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 2402451 9120433 11522884
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 30005353
1 23071232
2 10032754
3 3092622
4 736646
5 143158
6 23274
7 3348
8 424
9 50
>= 10 3

Total processing time: 48m48.698sec

BK_STOP 1678700809485

--------------------
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.002sec

115403 137849 406688 421736 454141
iterations count:580240 (2511), effective:17903 (77)

initing FirstDep: 0m 0.000sec

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

iterations count:9624 (41), effective:521 (2)

iterations count:9624 (41), effective:521 (2)

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

iterations count:9624 (41), effective:521 (2)

iterations count:7504 (32), effective:413 (1)

iterations count:7336 (31), effective:408 (1)

iterations count:1482 (6), effective:72 (0)

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

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

iterations count:1758 (7), effective:83 (0)

iterations count:4564 (19), effective:260 (1)

iterations count:4710 (20), effective:263 (1)

iterations count:550 (2), effective:10 (0)

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

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

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

iterations count:28505 (123), effective:1308 (5)

iterations count:1662 (7), effective:81 (0)

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

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

sat_reach.icc:155: Timeout: after 436 sec

iterations count:420 (1), effective:8 (0)

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

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

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

iterations count:28505 (123), effective:1308 (5)

iterations count:1229 (5), effective:26 (0)

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

iterations count:7504 (32), effective:411 (1)

iterations count:1588 (6), effective:74 (0)

iterations count:10400 (45), effective:613 (2)

iterations count:1414 (6), effective:60 (0)

iterations count:10378 (44), effective:613 (2)

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

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

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

iterations count:4044 (17), effective:101 (0)

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

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

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

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

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

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

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

iterations count:10378 (44), effective:613 (2)

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

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

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

iterations count:4044 (17), effective:101 (0)

iterations count:4331 (18), effective:211 (0)

iterations count:10378 (44), effective:613 (2)

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

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

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

iterations count:4044 (17), effective:101 (0)

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

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

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

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

iterations count:3055 (13), effective:169 (0)

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

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

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

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

iterations count:4553 (19), effective:257 (1)

iterations count:740 (3), effective:23 (0)

iterations count:11355 (49), effective:623 (2)

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

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

iterations count:28505 (123), effective:1308 (5)

iterations count:1662 (7), effective:81 (0)

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

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

iterations count:37922 (164), effective:1861 (8)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="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-11, 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-167840348500314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "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 ;