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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678705707860

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-13
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:08:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:08:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:08:30] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-13 11:08:30] [INFO ] Transformed 161 places.
[2023-03-13 11:08:30] [INFO ] Transformed 341 transitions.
[2023-03-13 11:08:30] [INFO ] Found NUPN structural information;
[2023-03-13 11:08:30] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 77 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 112 transition count 223
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 112 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 110 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 110 transition count 219
Applied a total of 102 rules in 39 ms. Remains 110 /161 variables (removed 51) and now considering 219/313 (removed 94) transitions.
[2023-03-13 11:08:31] [INFO ] Flow matrix only has 215 transitions (discarded 4 similar events)
// Phase 1: matrix 215 rows 110 cols
[2023-03-13 11:08:31] [INFO ] Computed 10 place invariants in 28 ms
[2023-03-13 11:08:31] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-13 11:08:31] [INFO ] Flow matrix only has 215 transitions (discarded 4 similar events)
[2023-03-13 11:08:31] [INFO ] Invariant cache hit.
[2023-03-13 11:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:08:31] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2023-03-13 11:08:31] [INFO ] Flow matrix only has 215 transitions (discarded 4 similar events)
[2023-03-13 11:08:31] [INFO ] Invariant cache hit.
[2023-03-13 11:08:31] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/161 places, 219/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 110/161 places, 219/313 transitions.
Support contains 77 out of 110 places after structural reductions.
[2023-03-13 11:08:32] [INFO ] Flatten gal took : 89 ms
[2023-03-13 11:08:32] [INFO ] Flatten gal took : 38 ms
[2023-03-13 11:08:32] [INFO ] Input system was already deterministic with 219 transitions.
Incomplete random walk after 10000 steps, including 774 resets, run finished after 940 ms. (steps per millisecond=10 ) properties (out of 64) seen :21
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) 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 43) 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 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) 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 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) 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 42) 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 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) 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 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) 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 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
[2023-03-13 11:08:33] [INFO ] Flow matrix only has 215 transitions (discarded 4 similar events)
[2023-03-13 11:08:33] [INFO ] Invariant cache hit.
[2023-03-13 11:08:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 11:08:34] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-13 11:08:34] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:41
[2023-03-13 11:08:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:08:34] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-13 11:08:34] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-13 11:08:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-13 11:08:34] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-13 11:08:35] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :39
[2023-03-13 11:08:35] [INFO ] After 556ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :39
[2023-03-13 11:08:36] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 9 ms to minimize.
[2023-03-13 11:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-13 11:08:36] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2023-03-13 11:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-13 11:08:36] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2023-03-13 11:08:36] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2023-03-13 11:08:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-13 11:08:37] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2023-03-13 11:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-13 11:08:37] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2023-03-13 11:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-13 11:08:37] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-13 11:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-13 11:08:37] [INFO ] After 2307ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :39
Attempting to minimize the solution found.
Minimization took 603 ms.
[2023-03-13 11:08:38] [INFO ] After 3962ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :39
Fused 42 Parikh solutions to 37 different solutions.
Parikh walk visited 2 properties in 313 ms.
Support contains 51 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 219/219 transitions.
Graph (trivial) has 32 edges and 110 vertex of which 6 / 110 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 442 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 22 place count 86 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 42 place count 86 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 85 transition count 167
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 85 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 46 place count 85 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 84 transition count 164
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 84 transition count 160
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 80 transition count 160
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 80 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 159
Applied a total of 59 rules in 84 ms. Remains 79 /110 variables (removed 31) and now considering 159/219 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 79/110 places, 159/219 transitions.
Incomplete random walk after 10000 steps, including 1015 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 37) seen :13
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-13 11:08:39] [INFO ] Flow matrix only has 150 transitions (discarded 9 similar events)
// Phase 1: matrix 150 rows 79 cols
[2023-03-13 11:08:39] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-13 11:08:39] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 11:08:39] [INFO ] After 199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:22
[2023-03-13 11:08:39] [INFO ] After 220ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-13 11:08:39] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-13 11:08:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 11:08:40] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-13 11:08:40] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-13 11:08:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-13 11:08:40] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2023-03-13 11:08:40] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2023-03-13 11:08:40] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2023-03-13 11:08:41] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2023-03-13 11:08:41] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2023-03-13 11:08:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 401 ms
[2023-03-13 11:08:41] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-13 11:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-13 11:08:41] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-13 11:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-13 11:08:41] [INFO ] After 1264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-13 11:08:41] [INFO ] After 1729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 20 different solutions.
Parikh walk visited 20 properties in 119 ms.
Support contains 11 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 159/159 transitions.
Graph (complete) has 326 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 78 transition count 158
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 77 transition count 158
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 21 place count 59 transition count 122
Iterating global reduction 0 with 18 rules applied. Total rules applied 39 place count 59 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 42 place count 56 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 45 place count 56 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 50 place count 56 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 55 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 55 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 55 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 54 transition count 105
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 51 transition count 125
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 51 transition count 123
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 51 transition count 119
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 47 transition count 119
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 47 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 46 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 46 transition count 118
Applied a total of 75 rules in 68 ms. Remains 46 /79 variables (removed 33) and now considering 118/159 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 46/79 places, 118/159 transitions.
Incomplete random walk after 10000 steps, including 2128 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 592 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 609 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 11:08:42] [INFO ] Flow matrix only has 105 transitions (discarded 13 similar events)
// Phase 1: matrix 105 rows 46 cols
[2023-03-13 11:08:42] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-13 11:08:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 11:08:42] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 11:08:42] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 11:08:42] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 11:08:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-13 11:08:42] [INFO ] After 22ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 11:08:42] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-13 11:08:42] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 116
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 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 111
Applied a total of 6 rules in 23 ms. Remains 43 /46 variables (removed 3) and now considering 111/118 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 43/46 places, 111/118 transitions.
Incomplete random walk after 10000 steps, including 2167 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 643 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 599 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7029 steps, run visited all 2 properties in 49 ms. (steps per millisecond=143 )
Probabilistic random walk after 7029 steps, saw 1570 distinct states, run finished after 55 ms. (steps per millisecond=127 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 31 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 28 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 219 transitions.
Computed a total of 10 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 64 transition count 128
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 64 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 58 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 58 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 58 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 56 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 56 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 54 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 54 transition count 99
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 54 transition count 93
Applied a total of 124 rules in 18 ms. Remains 54 /110 variables (removed 56) and now considering 93/219 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 54/110 places, 93/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 11 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 68 transition count 135
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 68 transition count 135
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 63 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 63 transition count 125
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 63 transition count 116
Applied a total of 103 rules in 11 ms. Remains 63 /110 variables (removed 47) and now considering 116/219 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 63/110 places, 116/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 15 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 15 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 69 transition count 138
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 69 transition count 138
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 63 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 63 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 101 place count 63 transition count 119
Applied a total of 101 rules in 11 ms. Remains 63 /110 variables (removed 47) and now considering 119/219 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 63/110 places, 119/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 15 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 66 transition count 132
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 66 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 63 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 63 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 63 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 62 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 62 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 61 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 61 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 61 transition count 115
Applied a total of 104 rules in 11 ms. Remains 61 /110 variables (removed 49) and now considering 115/219 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 61/110 places, 115/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 8 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 64 transition count 128
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 64 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 59 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 59 transition count 118
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 111 place count 59 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 58 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 58 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 57 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 57 transition count 104
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 57 transition count 101
Applied a total of 118 rules in 11 ms. Remains 57 /110 variables (removed 53) and now considering 101/219 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 57/110 places, 101/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 9 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 64 transition count 128
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 64 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 58 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 58 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 113 place count 58 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 57 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 57 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 56 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 56 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 56 transition count 99
Applied a total of 120 rules in 9 ms. Remains 56 /110 variables (removed 54) and now considering 99/219 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 56/110 places, 99/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 61 transition count 122
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 61 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 54 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 54 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 54 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 51 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 51 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 51 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 49 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 49 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 140 place count 49 transition count 77
Applied a total of 140 rules in 8 ms. Remains 49 /110 variables (removed 61) and now considering 77/219 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 49/110 places, 77/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 62 transition count 124
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 62 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 55 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 55 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 52 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 50 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 50 transition count 85
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 50 transition count 79
Applied a total of 138 rules in 11 ms. Remains 50 /110 variables (removed 60) and now considering 79/219 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 50/110 places, 79/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Graph (trivial) has 147 edges and 110 vertex of which 6 / 110 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 59 transition count 122
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 59 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 101 place count 53 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 107 place count 53 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 116 place count 53 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 51 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 51 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 49 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 49 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 49 transition count 85
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 49 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 48 transition count 83
Applied a total of 132 rules in 27 ms. Remains 48 /110 variables (removed 62) and now considering 83/219 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 48/110 places, 83/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 62 transition count 124
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 62 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 55 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 55 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 52 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 51 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 51 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 51 transition count 84
Applied a total of 133 rules in 8 ms. Remains 51 /110 variables (removed 59) and now considering 84/219 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 51/110 places, 84/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 65 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 65 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 60 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 60 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 60 transition count 111
Applied a total of 109 rules in 4 ms. Remains 60 /110 variables (removed 50) and now considering 111/219 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 60/110 places, 111/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 66 transition count 132
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 66 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 95 place count 59 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 102 place count 59 transition count 117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 59 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 56 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 56 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 56 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 55 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 55 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 55 transition count 96
Applied a total of 121 rules in 11 ms. Remains 55 /110 variables (removed 55) and now considering 96/219 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 55/110 places, 96/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 9 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 67 transition count 134
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 67 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 60 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 60 transition count 119
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 108 place count 60 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 57 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 57 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 55 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 55 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 55 transition count 91
Applied a total of 126 rules in 7 ms. Remains 55 /110 variables (removed 55) and now considering 91/219 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 55/110 places, 91/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 69 transition count 138
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 69 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 66 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 66 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 94 place count 66 transition count 126
Applied a total of 94 rules in 4 ms. Remains 66 /110 variables (removed 44) and now considering 126/219 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/110 places, 126/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 61 transition count 122
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 61 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 54 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 54 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 54 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 51 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 51 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 51 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 49 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 49 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 140 place count 49 transition count 77
Applied a total of 140 rules in 7 ms. Remains 49 /110 variables (removed 61) and now considering 77/219 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 49/110 places, 77/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 5 ms
[2023-03-13 11:08:43] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 219/219 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 70 transition count 140
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 70 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 66 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 66 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 94 place count 66 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 65 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 65 transition count 123
Applied a total of 96 rules in 6 ms. Remains 65 /110 variables (removed 45) and now considering 123/219 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 65/110 places, 123/219 transitions.
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 6 ms
[2023-03-13 11:08:43] [INFO ] Flatten gal took : 7 ms
[2023-03-13 11:08:44] [INFO ] Input system was already deterministic with 123 transitions.
[2023-03-13 11:08:44] [INFO ] Flatten gal took : 11 ms
[2023-03-13 11:08:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 11:08:44] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 11:08:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 219 transitions and 630 arcs took 2 ms.
Total runtime 13416 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: 110 NrTr: 219 NrArc: 630)

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

net check time: 0m 0.000sec

init dd package: 0m 3.505sec


RS generation: 0m54.211sec


-> reachability set: #nodes 541076 (5.4e+05) #states 183,431,518 (8)



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

checking: EX [EX [AG [[AX [[p16<=0 & 0<=p16]] & [[p33<=0 & 0<=p33] | [p65<=0 & 0<=p65]]]]]]
normalized: EX [EX [~ [E [true U ~ [[~ [EX [~ [[p16<=0 & 0<=p16]]]] & [[p65<=0 & 0<=p65] | [p33<=0 & 0<=p33]]]]]]]]

abstracting: (0<=p33)
states: 183,431,518 (8)
abstracting: (p33<=0)
states: 168,139,214 (8)
abstracting: (0<=p65)
states: 183,431,518 (8)
abstracting: (p65<=0)
states: 181,802,110 (8)
abstracting: (0<=p16)
states: 183,431,518 (8)
abstracting: (p16<=0)
states: 171,935,038 (8)
...-> the formula is TRUE

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

MC time: 1m46.337sec

checking: EG [AX [EF [[[p11<=1 & 1<=p11] | [[p20<=1 & 1<=p20] & [p107<=1 & 1<=p107]]]]]]
normalized: EG [~ [EX [~ [E [true U [[[p107<=1 & 1<=p107] & [p20<=1 & 1<=p20]] | [p11<=1 & 1<=p11]]]]]]]

abstracting: (1<=p11)
states: 27,019,512 (7)
abstracting: (p11<=1)
states: 183,431,518 (8)
abstracting: (1<=p20)
states: 31,859,624 (7)
abstracting: (p20<=1)
states: 183,431,518 (8)
abstracting: (1<=p107)
states: 10,941,072 (7)
abstracting: (p107<=1)
states: 183,431,518 (8)

before gc: list nodes free: 1240984

after gc: idd nodes used:1191630, unused:62808370; list nodes free:290397854
.........
EG iterations: 8
-> the formula is FALSE

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

MC time: 3m39.622sec

checking: EF [[[p30<=1 & 1<=p30] | AG [E [[p97<=1 & 1<=p97] U [p73<=1 & 1<=p73]]]]]
normalized: E [true U [~ [E [true U ~ [E [[p97<=1 & 1<=p97] U [p73<=1 & 1<=p73]]]]] | [p30<=1 & 1<=p30]]]

abstracting: (1<=p30)
states: 10,416,672 (7)
abstracting: (p30<=1)
states: 183,431,518 (8)
abstracting: (1<=p73)
states: 1
abstracting: (p73<=1)
states: 183,431,518 (8)
abstracting: (1<=p97)
states: 4,553,280 (6)
abstracting: (p97<=1)
states: 183,431,518 (8)
-> the formula is TRUE

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

MC time: 1m14.078sec

checking: EX [[~ [E [[p109<=1 & 1<=p109] U [p20<=1 & 1<=p20]]] & [[p75<=0 & 0<=p75] | [p95<=0 & 0<=p95]]]]
normalized: EX [[[[p95<=0 & 0<=p95] | [p75<=0 & 0<=p75]] & ~ [E [[p109<=1 & 1<=p109] U [p20<=1 & 1<=p20]]]]]

abstracting: (1<=p20)
states: 31,859,624 (7)
abstracting: (p20<=1)
states: 183,431,518 (8)
abstracting: (1<=p109)
states: 972
abstracting: (p109<=1)
states: 183,431,518 (8)
abstracting: (0<=p75)
states: 183,431,518 (8)
abstracting: (p75<=0)
states: 144,407,914 (8)
abstracting: (0<=p95)
states: 183,431,518 (8)
abstracting: (p95<=0)
states: 173,986,078 (8)

before gc: list nodes free: 1615472

after gc: idd nodes used:1718534, unused:62281466; list nodes free:290089150
.-> the formula is TRUE

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

MC time: 0m55.257sec

checking: AX [[~ [A [~ [[1<=p69 & p69<=1]] U E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]]] & EG [EX [[[p75<=0 & 0<=p75] | [p78<=0 & 0<=p78]]]]]]
normalized: ~ [EX [~ [[EG [EX [[[p78<=0 & 0<=p78] | [p75<=0 & 0<=p75]]]] & ~ [[~ [EG [~ [E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]]]] & ~ [E [~ [E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]] U [[1<=p69 & p69<=1] & ~ [E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]]]]]]]]]]]

abstracting: (1<=p67)
states: 20,977,056 (7)
abstracting: (p67<=1)
states: 183,431,518 (8)
abstracting: (1<=p42)
states: 45,857,877 (7)
abstracting: (p42<=1)
states: 183,431,518 (8)
abstracting: (p69<=1)
states: 183,431,518 (8)
abstracting: (1<=p69)
states: 5,500,296 (6)
abstracting: (1<=p67)
states: 20,977,056 (7)
abstracting: (p67<=1)
states: 183,431,518 (8)
abstracting: (1<=p42)
states: 45,857,877 (7)
abstracting: (p42<=1)
states: 183,431,518 (8)

before gc: list nodes free: 6056045

after gc: idd nodes used:2080877, unused:61919123; list nodes free:288576730
abstracting: (1<=p67)
states: 20,977,056 (7)
abstracting: (p67<=1)
states: 183,431,518 (8)
abstracting: (1<=p42)
states: 45,857,877 (7)
abstracting: (p42<=1)
states: 183,431,518 (8)
MC time: 4m18.214sec

checking: ~ [E [~ [EX [[[[p28<=1 & 1<=p28] & [[p81<=1 & 1<=p81] & ~ [[p84<=1 & 1<=p84]]]] | [AG [[p43<=1 & 1<=p43]] | EF [[p77<=1 & 1<=p77]]]]]] U [p7<=1 & 1<=p7]]]
normalized: ~ [E [~ [EX [[[E [true U [p77<=1 & 1<=p77]] | ~ [E [true U ~ [[p43<=1 & 1<=p43]]]]] | [[~ [[p84<=1 & 1<=p84]] & [p81<=1 & 1<=p81]] & [p28<=1 & 1<=p28]]]]] U [p7<=1 & 1<=p7]]]

abstracting: (1<=p7)
states: 10,414,320 (7)
abstracting: (p7<=1)
states: 183,431,518 (8)
abstracting: (1<=p28)
states: 9,810,576 (6)
abstracting: (p28<=1)
states: 183,431,518 (8)
abstracting: (1<=p81)
states: 4,553,280 (6)
abstracting: (p81<=1)
states: 183,431,518 (8)
abstracting: (1<=p84)
states: 580,608 (5)
abstracting: (p84<=1)
states: 183,431,518 (8)
abstracting: (1<=p43)
states: 34,413,936 (7)
abstracting: (p43<=1)
states: 183,431,518 (8)
abstracting: (1<=p77)
states: 4,553,280 (6)
abstracting: (p77<=1)
states: 183,431,518 (8)

before gc: list nodes free: 7734554

after gc: idd nodes used:2020310, unused:61979690; list nodes free:288752084
.-> the formula is TRUE

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

MC time: 3m41.069sec

checking: [EF [[p65<=1 & 1<=p65]] & EG [[A [AF [[p97<=1 & 1<=p97]] U ~ [[p88<=1 & 1<=p88]]] | [AX [[p27<=0 & 0<=p27]] & [EG [[p29<=0 & 0<=p29]] & EF [AX [[p48<=1 & 1<=p48]]]]]]]]
normalized: [EG [[[[EG [[p29<=0 & 0<=p29]] & E [true U ~ [EX [~ [[p48<=1 & 1<=p48]]]]]] & ~ [EX [~ [[p27<=0 & 0<=p27]]]]] | [~ [EG [[p88<=1 & 1<=p88]]] & ~ [E [[p88<=1 & 1<=p88] U [EG [~ [[p97<=1 & 1<=p97]]] & [p88<=1 & 1<=p88]]]]]]] & E [true U [p65<=1 & 1<=p65]]]

abstracting: (1<=p65)
states: 1,629,408 (6)
abstracting: (p65<=1)
states: 183,431,518 (8)
abstracting: (1<=p88)
states: 9,483,072 (6)
abstracting: (p88<=1)
states: 183,431,518 (8)
abstracting: (1<=p97)
states: 4,553,280 (6)
abstracting: (p97<=1)
states: 183,431,518 (8)
.
EG iterations: 1
abstracting: (1<=p88)
states: 9,483,072 (6)
abstracting: (p88<=1)
states: 183,431,518 (8)
abstracting: (1<=p88)
states: 9,483,072 (6)
abstracting: (p88<=1)
states: 183,431,518 (8)
.......
EG iterations: 7
abstracting: (0<=p27)
states: 183,431,518 (8)
abstracting: (p27<=0)
states: 174,993,262 (8)
.abstracting: (1<=p48)
states: 28,669,460 (7)
abstracting: (p48<=1)
states: 183,431,518 (8)

before gc: list nodes free: 3000491

after gc: idd nodes used:3368765, unused:60631235; list nodes free:282461899
.MC time: 3m58.033sec

checking: [AG [A [[p26<=1 & 1<=p26] U [p22<=1 & 1<=p22]]] | EF [~ [E [~ [[[p75<=1 & 1<=p75] & [p96<=1 & 1<=p96]]] U EX [AF [[[[p11<=1 & 1<=p11] & [p20<=1 & 1<=p20]] & [[p35<=1 & 1<=p35] & [p90<=1 & 1<=p90]]]]]]]]]
normalized: [E [true U ~ [E [~ [[[p96<=1 & 1<=p96] & [p75<=1 & 1<=p75]]] U EX [~ [EG [~ [[[[p90<=1 & 1<=p90] & [p35<=1 & 1<=p35]] & [[p20<=1 & 1<=p20] & [p11<=1 & 1<=p11]]]]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[p22<=1 & 1<=p22]]]] & ~ [E [~ [[p22<=1 & 1<=p22]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p22<=1 & 1<=p22]]]]]]]]]]

abstracting: (1<=p22)
states: 3,317,472 (6)
abstracting: (p22<=1)
states: 183,431,518 (8)
abstracting: (1<=p26)
states: 8,588,592 (6)
abstracting: (p26<=1)
states: 183,431,518 (8)
abstracting: (1<=p22)
states: 3,317,472 (6)
abstracting: (p22<=1)
states: 183,431,518 (8)
abstracting: (1<=p22)
states: 3,317,472 (6)
abstracting: (p22<=1)
states: 183,431,518 (8)
...
EG iterations: 3

before gc: list nodes free: 591728

after gc: idd nodes used:2450170, unused:61549830; list nodes free:286861495
abstracting: (1<=p11)
states: 27,019,512 (7)
abstracting: (p11<=1)
states: 183,431,518 (8)
abstracting: (1<=p20)
states: 31,859,624 (7)
abstracting: (p20<=1)
states: 183,431,518 (8)
abstracting: (1<=p35)
states: 21,754,552 (7)
abstracting: (p35<=1)
states: 183,431,518 (8)
abstracting: (1<=p90)
states: 4,553,280 (6)
abstracting: (p90<=1)
states: 183,431,518 (8)
MC time: 3m36.140sec

checking: E [~ [EX [0<=0]] U A [AX [[AX [[p9<=1 & 1<=p9]] & [[p15<=1 & 1<=p15] | [[[p20<=1 & 1<=p20] & [p107<=1 & 1<=p107]] | [[p69<=1 & 1<=p69] & [p92<=1 & 1<=p92]]]]]] U A [[p38<=1 & 1<=p38] U ~ [[[p6<=1 & 1<=p6] | EF [[p32<=1 & 1<=p32]]]]]]]
normalized: E [~ [EX [0<=0]] U [~ [EG [~ [[~ [EG [[E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]]]] & ~ [E [[E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]] U [~ [[p38<=1 & 1<=p38]] & [E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]]]]]]]]] & ~ [E [~ [[~ [EG [[E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]]]] & ~ [E [[E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]] U [~ [[p38<=1 & 1<=p38]] & [E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]]]]]]] U [EX [~ [[[[[[p92<=1 & 1<=p92] & [p69<=1 & 1<=p69]] | [[p107<=1 & 1<=p107] & [p20<=1 & 1<=p20]]] | [p15<=1 & 1<=p15]] & ~ [EX [~ [[p9<=1 & 1<=p9]]]]]]] & ~ [[~ [EG [[E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]]]] & ~ [E [[E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]] U [~ [[p38<=1 & 1<=p38]] & [E [true U [p32<=1 & 1<=p32]] | [p6<=1 & 1<=p6]]]]]]]]]]]]

abstracting: (1<=p6)
states: 9,262,752 (6)
abstracting: (p6<=1)
states: 183,431,518 (8)
abstracting: (1<=p32)
states: 14,967,688 (7)
abstracting: (p32<=1)
states: 183,431,518 (8)
abstracting: (1<=p38)
states: 9
abstracting: (p38<=1)
states: 183,431,518 (8)
abstracting: (1<=p6)
states: 9,262,752 (6)
abstracting: (p6<=1)
states: 183,431,518 (8)
abstracting: (1<=p32)
states: 14,967,688 (7)
abstracting: (p32<=1)
states: 183,431,518 (8)
abstracting: (1<=p6)
states: 9,262,752 (6)
abstracting: (p6<=1)
states: 183,431,518 (8)
abstracting: (1<=p32)
states: 14,967,688 (7)
abstracting: (p32<=1)
states: 183,431,518 (8)
..........
EG iterations: 10
abstracting: (1<=p9)
states: 18,434,160 (7)
abstracting: (p9<=1)
states: 183,431,518 (8)
.abstracting: (1<=p15)
states: 10,831,248 (7)
abstracting: (p15<=1)
states: 183,431,518 (8)
abstracting: (1<=p20)
states: 31,859,624 (7)
abstracting: (p20<=1)
states: 183,431,518 (8)
abstracting: (1<=p107)
states: 10,941,072 (7)
abstracting: (p107<=1)
states: 183,431,518 (8)
abstracting: (1<=p69)
states: 5,500,296 (6)
abstracting: (p69<=1)
states: 183,431,518 (8)
abstracting: (1<=p92)
states: 194,400 (5)
abstracting: (p92<=1)
states: 183,431,518 (8)
.abstracting: (1<=p6)
states: 9,262,752 (6)
abstracting: (p6<=1)
states: 183,431,518 (8)
abstracting: (1<=p32)
states: 14,967,688 (7)
abstracting: (p32<=1)
states: 183,431,518 (8)
MC time: 3m16.001sec

checking: EF [[AF [[[p35<=1 & 1<=p35] & [p107<=1 & 1<=p107]]] & [AF [[p58<=1 & 1<=p58]] | EX [[[[p56<=1 & 1<=p56] & [p107<=1 & 1<=p107]] | EX [[[[p11<=1 & 1<=p11] & [p20<=1 & 1<=p20]] & [[p35<=1 & 1<=p35] & [p105<=1 & 1<=p105]]]]]]]]]
normalized: E [true U [[EX [[[[p107<=1 & 1<=p107] & [p56<=1 & 1<=p56]] | EX [[[[p105<=1 & 1<=p105] & [p35<=1 & 1<=p35]] & [[p20<=1 & 1<=p20] & [p11<=1 & 1<=p11]]]]]] | ~ [EG [~ [[p58<=1 & 1<=p58]]]]] & ~ [EG [~ [[[p107<=1 & 1<=p107] & [p35<=1 & 1<=p35]]]]]]]

abstracting: (1<=p35)
states: 21,754,552 (7)
abstracting: (p35<=1)
states: 183,431,518 (8)
abstracting: (1<=p107)
states: 10,941,072 (7)
abstracting: (p107<=1)
states: 183,431,518 (8)

before gc: list nodes free: 1416897

after gc: idd nodes used:3196403, unused:60803597; list nodes free:282818166
.
EG iterations: 1
abstracting: (1<=p58)
states: 34,413,936 (7)
abstracting: (p58<=1)
states: 183,431,518 (8)
.
EG iterations: 1
abstracting: (1<=p11)
states: 27,019,512 (7)
abstracting: (p11<=1)
states: 183,431,518 (8)
abstracting: (1<=p20)
states: 31,859,624 (7)
abstracting: (p20<=1)
states: 183,431,518 (8)
abstracting: (1<=p35)
states: 21,754,552 (7)
abstracting: (p35<=1)
states: 183,431,518 (8)
abstracting: (1<=p105)
states: 6,415,848 (6)
abstracting: (p105<=1)
states: 183,431,518 (8)
.abstracting: (1<=p56)
states: 47,042,436 (7)
abstracting: (p56<=1)
states: 183,431,518 (8)
abstracting: (1<=p107)
states: 10,941,072 (7)
abstracting: (p107<=1)
states: 183,431,518 (8)
.-> the formula is TRUE

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

MC time: 2m38.831sec

checking: EG [E [[AX [~ [[p33<=1 & 1<=p33]]] & [~ [[EG [[[p35<=1 & 1<=p35] & [p107<=1 & 1<=p107]]] | E [[p69<=1 & 1<=p69] U [p37<=1 & 1<=p37]]]] & AF [[[p49<=1 & 1<=p49] | ~ [[[p75<=1 & 1<=p75] & [p99<=1 & 1<=p99]]]]]]] U AG [[p25<=1 & 1<=p25]]]]
normalized: EG [E [[[~ [EG [~ [[~ [[[p99<=1 & 1<=p99] & [p75<=1 & 1<=p75]]] | [p49<=1 & 1<=p49]]]]] & ~ [[E [[p69<=1 & 1<=p69] U [p37<=1 & 1<=p37]] | EG [[[p107<=1 & 1<=p107] & [p35<=1 & 1<=p35]]]]]] & ~ [EX [[p33<=1 & 1<=p33]]]] U ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]]]

abstracting: (1<=p25)
states: 14,967,688 (7)
abstracting: (p25<=1)
states: 183,431,518 (8)
abstracting: (1<=p33)
states: 15,292,304 (7)
abstracting: (p33<=1)
states: 183,431,518 (8)
.abstracting: (1<=p35)
states: 21,754,552 (7)
abstracting: (p35<=1)
states: 183,431,518 (8)
abstracting: (1<=p107)
states: 10,941,072 (7)
abstracting: (p107<=1)
states: 183,431,518 (8)
.
EG iterations: 1
abstracting: (1<=p37)
states: 3,016,312 (6)
abstracting: (p37<=1)
states: 183,431,518 (8)
abstracting: (1<=p69)
states: 5,500,296 (6)
abstracting: (p69<=1)
states: 183,431,518 (8)
abstracting: (1<=p49)
states: 28,670,432 (7)
abstracting: (p49<=1)
states: 183,431,518 (8)
abstracting: (1<=p75)
states: 39,023,604 (7)
abstracting: (p75<=1)
states: 183,431,518 (8)
abstracting: (1<=p99)
states: 852,768 (5)
abstracting: (p99<=1)
states: 183,431,518 (8)
......
EG iterations: 6
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m31.104sec

checking: AG [AX [EX [AX [[[[[p12<=0 & 0<=p12] | [p21<=0 & 0<=p21]] | [[p36<=0 & 0<=p36] | [[p41<=0 & 0<=p41] | [p47<=0 & 0<=p47]]]] | [[[p52<=0 & 0<=p52] | [p57<=0 & 0<=p57]] | [[p62<=0 & 0<=p62] | [[p75<=0 & 0<=p75] | [p108<=0 & 0<=p108]]]]]]]]]
normalized: ~ [E [true U EX [~ [EX [~ [EX [~ [[[[[[p108<=0 & 0<=p108] | [p75<=0 & 0<=p75]] | [p62<=0 & 0<=p62]] | [[p57<=0 & 0<=p57] | [p52<=0 & 0<=p52]]] | [[[[p47<=0 & 0<=p47] | [p41<=0 & 0<=p41]] | [p36<=0 & 0<=p36]] | [[p21<=0 & 0<=p21] | [p12<=0 & 0<=p12]]]]]]]]]]]]

abstracting: (0<=p12)
states: 183,431,518 (8)
abstracting: (p12<=0)
states: 156,412,006 (8)
abstracting: (0<=p21)
states: 183,431,518 (8)
abstracting: (p21<=0)
states: 151,571,894 (8)
abstracting: (0<=p36)
states: 183,431,518 (8)
abstracting: (p36<=0)
states: 161,676,966 (8)
abstracting: (0<=p41)
states: 183,431,518 (8)
abstracting: (p41<=0)
states: 137,573,641 (8)
abstracting: (0<=p47)
states: 183,431,518 (8)
abstracting: (p47<=0)
states: 145,096,282 (8)
abstracting: (0<=p52)
states: 183,431,518 (8)
abstracting: (p52<=0)
states: 151,769,810 (8)
abstracting: (0<=p57)
states: 183,431,518 (8)
abstracting: (p57<=0)
states: 136,389,082 (8)
abstracting: (0<=p62)
states: 183,431,518 (8)
abstracting: (p62<=0)
states: 145,096,282 (8)
abstracting: (0<=p75)
states: 183,431,518 (8)
abstracting: (p75<=0)
states: 144,407,914 (8)
abstracting: (0<=p108)
states: 183,431,518 (8)
abstracting: (p108<=0)
states: 165,063,885 (8)
..
before gc: list nodes free: 998741

after gc: idd nodes used:3495017, unused:60504983; list nodes free:284221359
.MC time: 3m10.074sec

checking: AG [[EF [[[[[p26<=0 & 0<=p26] & [p66<=0 & 0<=p66]] | AX [[p30<=0 & 0<=p30]]] & [p80<=0 & 0<=p80]]] | [[p28<=0 & 0<=p28] | EF [[[p54<=0 & 0<=p54] & [A [[p17<=1 & 1<=p17] U [p15<=1 & 1<=p15]] | [[p68<=1 & 1<=p68] | [p83<=1 & 1<=p83]]]]]]]]
normalized: ~ [E [true U ~ [[E [true U [[[[p26<=0 & 0<=p26] & [p66<=0 & 0<=p66]] | ~ [EX [~ [[p30<=0 & 0<=p30]]]]] & [p80<=0 & 0<=p80]]] | [E [true U [[[~ [E [~ [[p15<=1 & 1<=p15]] U [~ [[p15<=1 & 1<=p15]] & ~ [[p17<=1 & 1<=p17]]]]] & ~ [EG [~ [[p15<=1 & 1<=p15]]]]] | [[p68<=1 & 1<=p68] | [p83<=1 & 1<=p83]]] & [p54<=0 & 0<=p54]]] | [p28<=0 & 0<=p28]]]]]]

abstracting: (0<=p28)
states: 183,431,518 (8)
abstracting: (p28<=0)
states: 173,620,942 (8)
abstracting: (0<=p54)
states: 183,431,518 (8)
abstracting: (p54<=0)
states: 140,725,030 (8)
abstracting: (1<=p83)
states: 194,400 (5)
abstracting: (p83<=1)
states: 183,431,518 (8)
abstracting: (1<=p68)
states: 5,577,216 (6)
abstracting: (p68<=1)
states: 183,431,518 (8)
abstracting: (1<=p15)
states: 10,831,248 (7)
abstracting: (p15<=1)
states: 183,431,518 (8)
.
EG iterations: 1
abstracting: (1<=p17)
states: 20,977,760 (7)
abstracting: (p17<=1)
states: 183,431,518 (8)
abstracting: (1<=p15)
states: 10,831,248 (7)
abstracting: (p15<=1)
states: 183,431,518 (8)
abstracting: (1<=p15)
states: 10,831,248 (7)
abstracting: (p15<=1)
states: 183,431,518 (8)

before gc: list nodes free: 10364120

after gc: idd nodes used:3974205, unused:60025795; list nodes free:282088228
MC time: 2m49.099sec

checking: [EF [[p97<=1 & 1<=p97]] | E [E [[p17<=1 & 1<=p17] U AX [[[p37<=1 & 1<=p37] & [[p27<=1 & 1<=p27] | [p4<=1 & 1<=p4]]]]] U E [[[AX [[p28<=1 & 1<=p28]] & ~ [[p37<=1 & 1<=p37]]] & [[[p53<=1 & 1<=p53] | [p3<=1 & 1<=p3]] & [p106<=1 & 1<=p106]]] U [p30<=1 & 1<=p30]]]]
normalized: [E [E [[p17<=1 & 1<=p17] U ~ [EX [~ [[[[p4<=1 & 1<=p4] | [p27<=1 & 1<=p27]] & [p37<=1 & 1<=p37]]]]]] U E [[[~ [EX [~ [[p28<=1 & 1<=p28]]]] & ~ [[p37<=1 & 1<=p37]]] & [[p106<=1 & 1<=p106] & [[p3<=1 & 1<=p3] | [p53<=1 & 1<=p53]]]] U [p30<=1 & 1<=p30]]] | E [true U [p97<=1 & 1<=p97]]]

abstracting: (1<=p97)
states: 4,553,280 (6)
abstracting: (p97<=1)
states: 183,431,518 (8)
abstracting: (1<=p30)
states: 10,416,672 (7)
abstracting: (p30<=1)
states: 183,431,518 (8)
abstracting: (1<=p53)
states: 31,372,520 (7)
abstracting: (p53<=1)
states: 183,431,518 (8)
abstracting: (1<=p3)
states: 18,434,160 (7)
abstracting: (p3<=1)
states: 183,431,518 (8)
abstracting: (1<=p106)
states: 11,287,080 (7)
abstracting: (p106<=1)
states: 183,431,518 (8)
abstracting: (1<=p37)
states: 3,016,312 (6)
abstracting: (p37<=1)
states: 183,431,518 (8)
abstracting: (1<=p28)
states: 9,810,576 (6)
abstracting: (p28<=1)
states: 183,431,518 (8)
MC time: 2m30.033sec

checking: [EG [[[p44<=1 & 1<=p44] & ~ [E [EF [[p83<=1 & 1<=p83]] U [[p79<=1 & 1<=p79] | [p93<=1 & 1<=p93]]]]]] | EF [[E [~ [EX [[p29<=1 & 1<=p29]]] U [[[p61<=1 & 1<=p61] & [p107<=1 & 1<=p107]] | AG [[p43<=1 & 1<=p43]]]] & [[p31<=1 & 1<=p31] & EF [[EX [[p59<=1 & 1<=p59]] | [p16<=0 & 0<=p16]]]]]]]
normalized: [E [true U [[E [true U [[p16<=0 & 0<=p16] | EX [[p59<=1 & 1<=p59]]]] & [p31<=1 & 1<=p31]] & E [~ [EX [[p29<=1 & 1<=p29]]] U [~ [E [true U ~ [[p43<=1 & 1<=p43]]]] | [[p107<=1 & 1<=p107] & [p61<=1 & 1<=p61]]]]]] | EG [[~ [E [E [true U [p83<=1 & 1<=p83]] U [[p93<=1 & 1<=p93] | [p79<=1 & 1<=p79]]]] & [p44<=1 & 1<=p44]]]]

abstracting: (1<=p44)
states: 34,415,448 (7)
abstracting: (p44<=1)
states: 183,431,518 (8)
abstracting: (1<=p79)
states: 4,553,280 (6)
abstracting: (p79<=1)
states: 183,431,518 (8)
abstracting: (1<=p93)
states: 194,400 (5)
abstracting: (p93<=1)
states: 183,431,518 (8)
abstracting: (1<=p83)
states: 194,400 (5)
abstracting: (p83<=1)
states: 183,431,518 (8)

before gc: list nodes free: 12428518

after gc: idd nodes used:4604936, unused:59395064; list nodes free:279268637
MC time: 2m14.005sec

checking: E [EF [EX [[[[p4<=1 & 1<=p4] & [[p95<=1 & 1<=p95] & ~ [[p8<=1 & 1<=p8]]]] | [[p19<=1 & 1<=p19] & [[p18<=1 & 1<=p18] & [p72<=1 & 1<=p72]]]]]] U [~ [EX [[[p11<=1 & 1<=p11] & [p107<=1 & 1<=p107]]]] & EG [EF [AG [[[[[p12<=1 & 1<=p12] & [p21<=1 & 1<=p21]] & [[p36<=1 & 1<=p36] & [[p41<=1 & 1<=p41] & [p47<=1 & 1<=p47]]]] & [[[p52<=1 & 1<=p52] & [p57<=1 & 1<=p57]] & [[p62<=1 & 1<=p62] & [[p75<=1 & 1<=p75] & [p108<=1 & 1<=p108]]]]]]]]]]
normalized: E [E [true U EX [[[[[p72<=1 & 1<=p72] & [p18<=1 & 1<=p18]] & [p19<=1 & 1<=p19]] | [[~ [[p8<=1 & 1<=p8]] & [p95<=1 & 1<=p95]] & [p4<=1 & 1<=p4]]]]] U [EG [E [true U ~ [E [true U ~ [[[[[p36<=1 & 1<=p36] & [[p47<=1 & 1<=p47] & [p41<=1 & 1<=p41]]] & [[p21<=1 & 1<=p21] & [p12<=1 & 1<=p12]]] & [[[p62<=1 & 1<=p62] & [[p108<=1 & 1<=p108] & [p75<=1 & 1<=p75]]] & [[p57<=1 & 1<=p57] & [p52<=1 & 1<=p52]]]]]]]]] & ~ [EX [[[p107<=1 & 1<=p107] & [p11<=1 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 27,019,512 (7)
abstracting: (p11<=1)
states: 183,431,518 (8)
abstracting: (1<=p107)
states: 10,941,072 (7)
abstracting: (p107<=1)
states: 183,431,518 (8)
.abstracting: (1<=p52)
states: 31,661,708 (7)
abstracting: (p52<=1)
states: 183,431,518 (8)
abstracting: (1<=p57)
states: 47,042,436 (7)
abstracting: (p57<=1)
states: 183,431,518 (8)
abstracting: (1<=p75)
states: 39,023,604 (7)
abstracting: (p75<=1)
states: 183,431,518 (8)
abstracting: (1<=p108)
states: 18,367,633 (7)
abstracting: (p108<=1)
states: 183,431,518 (8)
abstracting: (1<=p62)
states: 38,335,236 (7)
abstracting: (p62<=1)
states: 183,431,518 (8)
abstracting: (1<=p12)
states: 27,019,512 (7)
abstracting: (p12<=1)
states: 183,431,518 (8)
abstracting: (1<=p21)
states: 31,859,624 (7)
abstracting: (p21<=1)
states: 183,431,518 (8)
abstracting: (1<=p41)
states: 45,857,877 (7)
abstracting: (p41<=1)
states: 183,431,518 (8)
abstracting: (1<=p47)
states: 38,335,236 (7)
abstracting: (p47<=1)
states: 183,431,518 (8)
abstracting: (1<=p36)
states: 21,754,552 (7)
abstracting: (p36<=1)
states: 183,431,518 (8)
.
EG iterations: 1
abstracting: (1<=p4)
states: 18,888,288 (7)
abstracting: (p4<=1)
states: 183,431,518 (8)
abstracting: (1<=p95)
states: 9,445,440 (6)
abstracting: (p95<=1)
states: 183,431,518 (8)
abstracting: (1<=p8)
states: 18,434,160 (7)
abstracting: (p8<=1)
states: 183,431,518 (8)
abstracting: (1<=p19)
states: 21,543,568 (7)
abstracting: (p19<=1)
states: 183,431,518 (8)
abstracting: (1<=p18)
states: 21,560,464 (7)
abstracting: (p18<=1)
states: 183,431,518 (8)
abstracting: (1<=p72)
states: 1
abstracting: (p72<=1)
states: 183,431,518 (8)
.MC time: 1m59.142sec

checking: AX [[~ [A [~ [[1<=p69 & p69<=1]] U E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]]] & EG [EX [[[p75<=0 & 0<=p75] | [p78<=0 & 0<=p78]]]]]]
normalized: ~ [EX [~ [[EG [EX [[[p78<=0 & 0<=p78] | [p75<=0 & 0<=p75]]]] & ~ [[~ [EG [~ [E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]]]] & ~ [E [~ [E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]] U [[1<=p69 & p69<=1] & ~ [E [[p42<=1 & 1<=p42] U [p67<=1 & 1<=p67]]]]]]]]]]]]

abstracting: (1<=p67)
states: 20,977,056 (7)
abstracting: (p67<=1)
states: 183,431,518 (8)
abstracting: (1<=p42)
states: 45,857,877 (7)
abstracting: (p42<=1)
states: 183,431,518 (8)

before gc: list nodes free: 11667656

after gc: idd nodes used:4875401, unused:59124599; list nodes free:277983067
abstracting: (p69<=1)
states: 183,431,518 (8)
abstracting: (1<=p69)
states: 5,500,296 (6)
abstracting: (1<=p67)
states: 20,977,056 (7)
abstracting: (p67<=1)
states: 183,431,518 (8)
abstracting: (1<=p42)
states: 45,857,877 (7)
abstracting: (p42<=1)
states: 183,431,518 (8)
abstracting: (1<=p67)
states: 20,977,056 (7)
abstracting: (p67<=1)
states: 183,431,518 (8)
abstracting: (1<=p42)
states: 45,857,877 (7)
abstracting: (p42<=1)
states: 183,431,518 (8)

before gc: list nodes free: 13064413

after gc: idd nodes used:5517804, unused:58482196; list nodes free:275121426
..
EG iterations: 2
abstracting: (0<=p75)
states: 183,431,518 (8)
abstracting: (p75<=0)
states: 144,407,914 (8)
abstracting: (0<=p78)
states: 183,431,518 (8)
abstracting: (p78<=0)
states: 173,986,078 (8)
..........
EG iterations: 9
.-> the formula is FALSE

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

MC time: 8m 2.516sec

checking: [EF [[p65<=1 & 1<=p65]] & EG [[A [AF [[p97<=1 & 1<=p97]] U ~ [[p88<=1 & 1<=p88]]] | [AX [[p27<=0 & 0<=p27]] & [EG [[p29<=0 & 0<=p29]] & EF [AX [[p48<=1 & 1<=p48]]]]]]]]
normalized: [EG [[[[E [true U ~ [EX [~ [[p48<=1 & 1<=p48]]]]] & EG [[p29<=0 & 0<=p29]]] & ~ [EX [~ [[p27<=0 & 0<=p27]]]]] | [~ [EG [[p88<=1 & 1<=p88]]] & ~ [E [[p88<=1 & 1<=p88] U [EG [~ [[p97<=1 & 1<=p97]]] & [p88<=1 & 1<=p88]]]]]]] & E [true U [p65<=1 & 1<=p65]]]

abstracting: (1<=p65)
states: 1,629,408 (6)
abstracting: (p65<=1)
states: 183,431,518 (8)
abstracting: (1<=p88)
states: 9,483,072 (6)
abstracting: (p88<=1)
states: 183,431,518 (8)
abstracting: (1<=p97)
states: 4,553,280 (6)
abstracting: (p97<=1)
states: 183,431,518 (8)

before gc: list nodes free: 1330093

after gc: idd nodes used:4936017, unused:59063983; list nodes free:290291385
.
EG iterations: 1
abstracting: (1<=p88)
states: 9,483,072 (6)
abstracting: (p88<=1)
states: 183,431,518 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5718360 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097108 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

10432 10178
iterations count:278632 (1272), effective:13986 (63)

initing FirstDep: 0m 0.000sec


iterations count:5043 (23), effective:310 (1)

iterations count:2861 (13), effective:190 (0)

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

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

iterations count:4958 (22), effective:308 (1)

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

iterations count:6440 (29), effective:400 (1)

iterations count:6440 (29), effective:400 (1)

iterations count:2264 (10), effective:133 (0)

iterations count:6440 (29), effective:400 (1)

net_ddint.h:600: Timeout: after 257 sec


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

iterations count:6673 (30), effective:431 (1)

iterations count:776 (3), effective:27 (0)

iterations count:5052 (23), effective:307 (1)

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

sat_reach.icc:155: Timeout: after 237 sec


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

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

net_ddint.h:600: Timeout: after 215 sec


iterations count:3393 (15), effective:199 (0)

iterations count:3393 (15), effective:199 (0)

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

iterations count:3393 (15), effective:199 (0)

sat_reach.icc:155: Timeout: after 195 sec


iterations count:4910 (22), effective:318 (1)

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

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

sat_reach.icc:155: Timeout: after 189 sec


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

sat_reach.icc:155: Timeout: after 168 sec


iterations count:6762 (30), effective:441 (2)

net_ddint.h:600: Timeout: after 149 sec


iterations count:4955 (22), effective:311 (1)

iterations count:3121 (14), effective:186 (0)

net_ddint.h:600: Timeout: after 133 sec


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

sat_reach.icc:155: Timeout: after 118 sec


iterations count:6440 (29), effective:400 (1)

iterations count:6440 (29), effective:400 (1)

iterations count:2264 (10), effective:133 (0)

iterations count:6440 (29), effective:400 (1)

iterations count:5052 (23), effective:307 (1)

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

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-13"
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-13, 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-167840348500330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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