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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 26 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K 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-07-CTLCardinality-00
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-01
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-02
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-03
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-04
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-05
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-06
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-07
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-08
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-09
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-10
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-11
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-12
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-13
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-14
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678685135015

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:25:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:25:38] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-13 05:25:38] [INFO ] Transformed 155 places.
[2023-03-13 05:25:38] [INFO ] Transformed 320 transitions.
[2023-03-13 05:25:38] [INFO ] Found NUPN structural information;
[2023-03-13 05:25:38] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-07-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 121 transition count 230
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 121 transition count 230
Applied a total of 68 rules in 29 ms. Remains 121 /155 variables (removed 34) and now considering 230/295 (removed 65) transitions.
[2023-03-13 05:25:38] [INFO ] Flow matrix only has 221 transitions (discarded 9 similar events)
// Phase 1: matrix 221 rows 121 cols
[2023-03-13 05:25:38] [INFO ] Computed 15 place invariants in 20 ms
[2023-03-13 05:25:38] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-13 05:25:38] [INFO ] Flow matrix only has 221 transitions (discarded 9 similar events)
[2023-03-13 05:25:38] [INFO ] Invariant cache hit.
[2023-03-13 05:25:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:25:38] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-13 05:25:38] [INFO ] Flow matrix only has 221 transitions (discarded 9 similar events)
[2023-03-13 05:25:38] [INFO ] Invariant cache hit.
[2023-03-13 05:25:38] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/155 places, 230/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 121/155 places, 230/295 transitions.
Support contains 85 out of 121 places after structural reductions.
[2023-03-13 05:25:39] [INFO ] Flatten gal took : 69 ms
[2023-03-13 05:25:39] [INFO ] Flatten gal took : 26 ms
[2023-03-13 05:25:39] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 83 out of 121 places (down from 85) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 534 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 65) seen :30
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-13 05:25:40] [INFO ] Flow matrix only has 221 transitions (discarded 9 similar events)
[2023-03-13 05:25:40] [INFO ] Invariant cache hit.
[2023-03-13 05:25:40] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:34
[2023-03-13 05:25:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-13 05:25:40] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-13 05:25:41] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :34
[2023-03-13 05:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:25:41] [INFO ] After 345ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :34
[2023-03-13 05:25:42] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 10 ms to minimize.
[2023-03-13 05:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-13 05:25:42] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2023-03-13 05:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-13 05:25:42] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2023-03-13 05:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-13 05:25:42] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2023-03-13 05:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-13 05:25:42] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2023-03-13 05:25:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 101 ms
[2023-03-13 05:25:42] [INFO ] After 1447ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :33
Attempting to minimize the solution found.
Minimization took 372 ms.
[2023-03-13 05:25:43] [INFO ] After 2738ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :33
Fused 35 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 48 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 230/230 transitions.
Graph (trivial) has 73 edges and 121 vertex of which 8 / 121 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 511 edges and 117 vertex of which 114 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 114 transition count 211
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 113 transition count 208
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 111 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 111 transition count 205
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 110 transition count 205
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 32 place count 91 transition count 167
Iterating global reduction 3 with 19 rules applied. Total rules applied 51 place count 91 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 90 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 90 transition count 165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 88 transition count 178
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 88 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 88 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 86 transition count 174
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 86 transition count 174
Applied a total of 65 rules in 84 ms. Remains 86 /121 variables (removed 35) and now considering 174/230 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 86/121 places, 174/230 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 33) seen :0
Finished probabilistic random walk after 266287 steps, run visited all 33 properties in 1328 ms. (steps per millisecond=200 )
Probabilistic random walk after 266287 steps, saw 37847 distinct states, run finished after 1329 ms. (steps per millisecond=200 ) properties seen :33
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-13 05:25:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 20 ms
FORMULA HealthRecord-PT-07-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 18 ms
[2023-03-13 05:25:46] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 71 out of 121 places (down from 81) after GAL structural reductions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 76 transition count 143
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 76 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 71 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 71 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 71 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 69 transition count 123
Applied a total of 109 rules in 15 ms. Remains 69 /121 variables (removed 52) and now considering 123/230 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 69/121 places, 123/230 transitions.
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 9 ms
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 9 ms
[2023-03-13 05:25:46] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Graph (trivial) has 150 edges and 121 vertex of which 12 / 121 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 69 transition count 138
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 69 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 98 place count 64 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 103 place count 64 transition count 128
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 112 place count 64 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 63 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 63 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 62 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 62 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 117 place count 62 transition count 113
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 62 transition count 107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 131 place count 58 transition count 103
Applied a total of 131 rules in 38 ms. Remains 58 /121 variables (removed 63) and now considering 103/230 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 58/121 places, 103/230 transitions.
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 8 ms
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 8 ms
[2023-03-13 05:25:46] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Graph (trivial) has 168 edges and 121 vertex of which 14 / 121 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 53 place count 61 transition count 124
Iterating global reduction 0 with 52 rules applied. Total rules applied 105 place count 61 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 112 place count 54 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 119 place count 54 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 125 place count 54 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 51 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 51 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 134 place count 48 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 48 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 146 place count 48 transition count 80
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 48 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 46 transition count 71
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 42 transition count 67
Applied a total of 161 rules in 34 ms. Remains 42 /121 variables (removed 79) and now considering 67/230 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 42/121 places, 67/230 transitions.
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:46] [INFO ] Input system was already deterministic with 67 transitions.
Incomplete random walk after 10000 steps, including 1008 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 3787 steps, including 62 resets, run visited all 1 properties in 5 ms. (steps per millisecond=757 )
FORMULA HealthRecord-PT-07-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 131
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 61 transition count 115
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 61 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 127 place count 61 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 59 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 59 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 57 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 57 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 139 place count 57 transition count 94
Applied a total of 139 rules in 11 ms. Remains 57 /121 variables (removed 64) and now considering 94/230 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 57/121 places, 94/230 transitions.
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:46] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 67 transition count 128
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 67 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 60 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 60 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 127 place count 60 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 59 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 59 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 58 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 58 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 134 place count 58 transition count 101
Applied a total of 134 rules in 10 ms. Remains 58 /121 variables (removed 63) and now considering 101/230 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 58/121 places, 101/230 transitions.
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:46] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:46] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 124
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 58 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 58 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 135 place count 58 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 56 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 54 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 54 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 148 place count 54 transition count 86
Applied a total of 148 rules in 9 ms. Remains 54 /121 variables (removed 67) and now considering 86/230 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 54/121 places, 86/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Graph (trivial) has 133 edges and 121 vertex of which 14 / 121 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 65 transition count 130
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 65 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 107 place count 57 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 115 place count 57 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 57 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 56 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 55 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 55 transition count 97
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 55 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 50 transition count 86
Applied a total of 147 rules in 25 ms. Remains 50 /121 variables (removed 71) and now considering 86/230 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 50/121 places, 86/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 64 transition count 122
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 64 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 56 transition count 106
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 56 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 53 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 50 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 50 transition count 82
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 159 place count 50 transition count 74
Applied a total of 159 rules in 7 ms. Remains 50 /121 variables (removed 71) and now considering 74/230 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 50/121 places, 74/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 132
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 62 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 62 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 127 place count 62 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 61 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 61 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 60 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 60 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 134 place count 60 transition count 101
Applied a total of 134 rules in 7 ms. Remains 60 /121 variables (removed 61) and now considering 101/230 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 60/121 places, 101/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 131
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 131
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 62 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 62 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 62 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 60 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 60 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 58 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 58 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 141 place count 58 transition count 92
Applied a total of 141 rules in 8 ms. Remains 58 /121 variables (removed 63) and now considering 92/230 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 58/121 places, 92/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Graph (trivial) has 158 edges and 121 vertex of which 14 / 121 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 52 place count 62 transition count 126
Iterating global reduction 0 with 51 rules applied. Total rules applied 103 place count 62 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 110 place count 55 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 117 place count 55 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 122 place count 55 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 49 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 143 place count 49 transition count 83
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 150 place count 49 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 43 transition count 70
Applied a total of 158 rules in 24 ms. Remains 43 /121 variables (removed 78) and now considering 70/230 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 43/121 places, 70/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 124
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 57 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 57 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 140 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 143 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 53 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 53 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 148 place count 53 transition count 85
Applied a total of 148 rules in 7 ms. Remains 53 /121 variables (removed 68) and now considering 85/230 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 53/121 places, 85/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 230/230 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 72 transition count 137
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 72 transition count 137
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 66 transition count 125
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 66 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 66 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 64 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 63 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 63 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 123 place count 63 transition count 110
Applied a total of 123 rules in 7 ms. Remains 63 /121 variables (removed 58) and now considering 110/230 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 63/121 places, 110/230 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:25:47] [INFO ] Input system was already deterministic with 110 transitions.
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:25:47] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:25:47] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 05:25:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 230 transitions and 652 arcs took 2 ms.
Total runtime 9520 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 121 NrTr: 230 NrArc: 652)

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

net check time: 0m 0.000sec

init dd package: 0m 3.643sec


RS generation: 0m40.813sec


-> reachability set: #nodes 612914 (6.1e+05) #states 138,549,515 (8)



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

checking: EF [EX [[p10<=1 & 1<=p10]]]
normalized: E [true U EX [[p10<=1 & 1<=p10]]]

abstracting: (1<=p10)
states: 10,245,120 (7)
abstracting: (p10<=1)
states: 138,549,515 (8)
.-> the formula is TRUE

FORMULA HealthRecord-PT-07-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 3.947sec

checking: AG [E [[[p27<=1 & 1<=p27] & ~ [EG [AF [[p70<=0 & 0<=p70]]]]] U [p34<=0 & 0<=p34]]]
normalized: ~ [E [true U ~ [E [[~ [EG [~ [EG [~ [[p70<=0 & 0<=p70]]]]]] & [p27<=1 & 1<=p27]] U [p34<=0 & 0<=p34]]]]]

abstracting: (0<=p34)
states: 138,549,515 (8)
abstracting: (p34<=0)
states: 128,668,427 (8)
abstracting: (1<=p27)
states: 21,970,176 (7)
abstracting: (p27<=1)
states: 138,549,515 (8)
abstracting: (0<=p70)
states: 138,549,515 (8)
abstracting: (p70<=0)
states: 124,848,395 (8)
.......
EG iterations: 7

before gc: list nodes free: 924803

after gc: idd nodes used:1635228, unused:62364772; list nodes free:283959495
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-07-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m46.720sec

checking: [EF [EX [EF [[p100<=1 & 1<=p100]]]] | EG [EX [[AG [[p114<=0 & 0<=p114]] & [[p77<=1 & 1<=p77] & [p62<=1 & 1<=p62]]]]]]
normalized: [EG [EX [[[[p62<=1 & 1<=p62] & [p77<=1 & 1<=p77]] & ~ [E [true U ~ [[p114<=0 & 0<=p114]]]]]]] | E [true U EX [E [true U [p100<=1 & 1<=p100]]]]]

abstracting: (1<=p100)
states: 7,140,096 (6)
abstracting: (p100<=1)
states: 138,549,515 (8)

before gc: list nodes free: 1677574

after gc: idd nodes used:1437576, unused:62562424; list nodes free:285170732
.abstracting: (0<=p114)
states: 138,549,515 (8)
abstracting: (p114<=0)
states: 138,549,514 (8)

before gc: list nodes free: 7243481

after gc: idd nodes used:1877991, unused:62122009; list nodes free:283279914
MC time: 5m21.026sec

checking: E [[[p75<=0 & 0<=p75] | [p101<=1 & 1<=p101]] U A [~ [EF [[p84<=0 & 0<=p84]]] U ~ [AX [[[p9<=0 & 0<=p9] | [p30<=1 & 1<=p30]]]]]]
normalized: E [[[p101<=1 & 1<=p101] | [p75<=0 & 0<=p75]] U [~ [E [~ [EX [~ [[[p30<=1 & 1<=p30] | [p9<=0 & 0<=p9]]]]] U [E [true U [p84<=0 & 0<=p84]] & ~ [EX [~ [[[p30<=1 & 1<=p30] | [p9<=0 & 0<=p9]]]]]]]] & ~ [EG [~ [EX [~ [[[p30<=1 & 1<=p30] | [p9<=0 & 0<=p9]]]]]]]]]

abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
..
EG iterations: 1
abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
.abstracting: (0<=p84)
states: 138,549,515 (8)
abstracting: (p84<=0)
states: 138,549,514 (8)
abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
.abstracting: (0<=p75)
states: 138,549,515 (8)
abstracting: (p75<=0)
states: 137,955,083 (8)
abstracting: (1<=p101)
states: 62,208 (4)
abstracting: (p101<=1)
states: 138,549,515 (8)

before gc: list nodes free: 1789013

after gc: idd nodes used:1833437, unused:62166563; list nodes free:285471227
MC time: 4m49.038sec

checking: AX [[EF [[p11<=0 & 0<=p11]] & [~ [A [AF [[p10<=0 & 0<=p10]] U AG [[[p35<=0 & 0<=p35] | [p5<=1 & 1<=p5]]]]] | [[p52<=0 & 0<=p52] & [p3<=1 & 1<=p3]]]]]
normalized: ~ [EX [~ [[[~ [[~ [EG [E [true U ~ [[[p5<=1 & 1<=p5] | [p35<=0 & 0<=p35]]]]]] & ~ [E [E [true U ~ [[[p5<=1 & 1<=p5] | [p35<=0 & 0<=p35]]]] U [EG [~ [[p10<=0 & 0<=p10]]] & E [true U ~ [[[p5<=1 & 1<=p5] | [p35<=0 & 0<=p35]]]]]]]]] | [[p3<=1 & 1<=p3] & [p52<=0 & 0<=p52]]] & E [true U [p11<=0 & 0<=p11]]]]]]

abstracting: (0<=p11)
states: 138,549,515 (8)
abstracting: (p11<=0)
states: 128,304,395 (8)
abstracting: (0<=p52)
states: 138,549,515 (8)
abstracting: (p52<=0)
states: 138,549,505 (8)
abstracting: (1<=p3)
states: 10,404,864 (7)
abstracting: (p3<=1)
states: 138,549,515 (8)
abstracting: (0<=p35)
states: 138,549,515 (8)
abstracting: (p35<=0)
states: 134,312,459 (8)
abstracting: (1<=p5)
states: 10,403,328 (7)
abstracting: (p5<=1)
states: 138,549,515 (8)
abstracting: (0<=p10)
states: 138,549,515 (8)
abstracting: (p10<=0)
states: 128,304,395 (8)
.......
EG iterations: 7
abstracting: (0<=p35)
states: 138,549,515 (8)
abstracting: (p35<=0)
states: 134,312,459 (8)
abstracting: (1<=p5)
states: 10,403,328 (7)
abstracting: (p5<=1)
states: 138,549,515 (8)

before gc: list nodes free: 6569912

after gc: idd nodes used:2201680, unused:61798320; list nodes free:283840663
abstracting: (0<=p35)
states: 138,549,515 (8)
abstracting: (p35<=0)
states: 134,312,459 (8)
abstracting: (1<=p5)
states: 10,403,328 (7)
abstracting: (p5<=1)
states: 138,549,515 (8)
MC time: 4m20.307sec

checking: AG [AX [[[p102<=1 & 1<=p102] | [[EG [[p53<=0 & 0<=p53]] & [p15<=0 & 0<=p15]] & [[p69<=1 & 1<=p69] & [[p38<=0 & 0<=p38] & [p26<=1 & 1<=p26]]]]]]]
normalized: ~ [E [true U EX [~ [[[[[[p26<=1 & 1<=p26] & [p38<=0 & 0<=p38]] & [p69<=1 & 1<=p69]] & [[p15<=0 & 0<=p15] & EG [[p53<=0 & 0<=p53]]]] | [p102<=1 & 1<=p102]]]]]]

abstracting: (1<=p102)
states: 2,764,800 (6)
abstracting: (p102<=1)
states: 138,549,515 (8)
abstracting: (0<=p53)
states: 138,549,515 (8)
abstracting: (p53<=0)
states: 103,912,139 (8)
.......
EG iterations: 7
abstracting: (0<=p15)
states: 138,549,515 (8)
abstracting: (p15<=0)
states: 121,498,379 (8)
abstracting: (1<=p69)
states: 13,684,224 (7)
abstracting: (p69<=1)
states: 138,549,515 (8)
abstracting: (0<=p38)
states: 138,549,515 (8)
abstracting: (p38<=0)
states: 134,459,915 (8)
abstracting: (1<=p26)
states: 12,109,056 (7)
abstracting: (p26<=1)
states: 138,549,515 (8)
.-> the formula is FALSE

FORMULA HealthRecord-PT-07-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m50.576sec

checking: EF [[AG [AF [~ [E [[p21<=1 & 1<=p21] U [p64<=0 & 0<=p64]]]]] & [AX [[[p87<=0 & 0<=p87] | [p82<=1 & 1<=p82]]] | EX [[[p41<=0 & 0<=p41] & [p97<=0 & 0<=p97]]]]]]
normalized: E [true U [[EX [[[p97<=0 & 0<=p97] & [p41<=0 & 0<=p41]]] | ~ [EX [~ [[[p82<=1 & 1<=p82] | [p87<=0 & 0<=p87]]]]]] & ~ [E [true U EG [E [[p21<=1 & 1<=p21] U [p64<=0 & 0<=p64]]]]]]]

abstracting: (0<=p64)
states: 138,549,515 (8)
abstracting: (p64<=0)
states: 103,912,139 (8)
abstracting: (1<=p21)
states: 5,988,864 (6)
abstracting: (p21<=1)
states: 138,549,515 (8)

before gc: list nodes free: 1948020

after gc: idd nodes used:2810391, unused:61189609; list nodes free:287438709
..
EG iterations: 2
abstracting: (0<=p87)
states: 138,549,515 (8)
abstracting: (p87<=0)
states: 138,549,509 (8)
abstracting: (1<=p82)
states: 1
abstracting: (p82<=1)
states: 138,549,515 (8)
.abstracting: (0<=p41)
states: 138,549,515 (8)
abstracting: (p41<=0)
states: 128,814,347 (8)
abstracting: (0<=p97)
states: 138,549,515 (8)
abstracting: (p97<=0)
states: 138,487,307 (8)
.-> the formula is FALSE

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

MC time: 3m28.623sec

checking: EF [[AG [[[EX [[p79<=1 & 1<=p79]] & [p97<=1 & 1<=p97]] & [[[p37<=0 & 0<=p37] | [p51<=1 & 1<=p51]] & [p74<=1 & 1<=p74]]]] & [EF [[p105<=0 & 0<=p105]] & [p12<=1 & 1<=p12]]]]
normalized: E [true U [[[p12<=1 & 1<=p12] & E [true U [p105<=0 & 0<=p105]]] & ~ [E [true U ~ [[[[p74<=1 & 1<=p74] & [[p51<=1 & 1<=p51] | [p37<=0 & 0<=p37]]] & [[p97<=1 & 1<=p97] & EX [[p79<=1 & 1<=p79]]]]]]]]]

abstracting: (1<=p79)
states: 3,343,872 (6)
abstracting: (p79<=1)
states: 138,549,515 (8)
.abstracting: (1<=p97)
states: 62,208 (4)
abstracting: (p97<=1)
states: 138,549,515 (8)
abstracting: (0<=p37)
states: 138,549,515 (8)
abstracting: (p37<=0)
states: 134,370,059 (8)
abstracting: (1<=p51)
states: 34,637,376 (7)
abstracting: (p51<=1)
states: 138,549,515 (8)
abstracting: (1<=p74)
states: 576,000 (5)
abstracting: (p74<=1)
states: 138,549,515 (8)
abstracting: (0<=p105)
states: 138,549,515 (8)
abstracting: (p105<=0)
states: 135,784,715 (8)
abstracting: (1<=p12)
states: 4,474,368 (6)
abstracting: (p12<=1)
states: 138,549,515 (8)
-> the formula is FALSE

FORMULA HealthRecord-PT-07-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.616sec

checking: E [[[p36<=0 & 0<=p36] | [p67<=1 & 1<=p67]] U EG [AF [[[E [[p8<=1 & 1<=p8] U [p47<=0 & 0<=p47]] & ~ [[p30<=1 & 1<=p30]]] & [[p114<=0 & 0<=p114] & [[p120<=1 & 1<=p120] | [p7<=1 & 1<=p7]]]]]]]
normalized: E [[[p67<=1 & 1<=p67] | [p36<=0 & 0<=p36]] U EG [~ [EG [~ [[[[[p7<=1 & 1<=p7] | [p120<=1 & 1<=p120]] & [p114<=0 & 0<=p114]] & [~ [[p30<=1 & 1<=p30]] & E [[p8<=1 & 1<=p8] U [p47<=0 & 0<=p47]]]]]]]]]

abstracting: (0<=p47)
states: 138,549,515 (8)
abstracting: (p47<=0)
states: 138,549,505 (8)
abstracting: (1<=p8)
states: 4,520,448 (6)
abstracting: (p8<=1)
states: 138,549,515 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
abstracting: (0<=p114)
states: 138,549,515 (8)
abstracting: (p114<=0)
states: 138,549,514 (8)
abstracting: (1<=p120)
states: 13,059,073 (7)
abstracting: (p120<=1)
states: 138,549,515 (8)
abstracting: (1<=p7)
states: 4,963,584 (6)
abstracting: (p7<=1)
states: 138,549,515 (8)
......
EG iterations: 6
...
EG iterations: 3
abstracting: (0<=p36)
states: 138,549,515 (8)
abstracting: (p36<=0)
states: 133,949,195 (8)
abstracting: (1<=p67)
states: 46,183,168 (7)
abstracting: (p67<=1)
states: 138,549,515 (8)

before gc: list nodes free: 2050772

after gc: idd nodes used:4309236, unused:59690764; list nodes free:282961663
MC time: 4m36.002sec

checking: [E [[[p49<=0 & 0<=p49] | [p12<=1 & 1<=p12]] U AF [EG [A [[p72<=1 & 1<=p72] U [p78<=1 & 1<=p78]]]]] | AG [[E [~ [[p60<=1 & 1<=p60]] U EG [[[p9<=0 & 0<=p9] | [p29<=1 & 1<=p29]]]] | [EF [[[[p24<=0 & 0<=p24] & [p60<=1 & 1<=p60]] & [[p39<=0 & 0<=p39] & [p16<=1 & 1<=p16]]]] | [p98<=0 & 0<=p98]]]]]
normalized: [~ [E [true U ~ [[E [~ [[p60<=1 & 1<=p60]] U EG [[[p29<=1 & 1<=p29] | [p9<=0 & 0<=p9]]]] | [[p98<=0 & 0<=p98] | E [true U [[[p16<=1 & 1<=p16] & [p39<=0 & 0<=p39]] & [[p60<=1 & 1<=p60] & [p24<=0 & 0<=p24]]]]]]]]] | E [[[p12<=1 & 1<=p12] | [p49<=0 & 0<=p49]] U ~ [EG [~ [EG [[~ [EG [~ [[p78<=1 & 1<=p78]]]] & ~ [E [~ [[p78<=1 & 1<=p78]] U [~ [[p72<=1 & 1<=p72]] & ~ [[p78<=1 & 1<=p78]]]]]]]]]]]]

abstracting: (1<=p78)
states: 7,410,432 (6)
abstracting: (p78<=1)
states: 138,549,515 (8)
abstracting: (1<=p72)
states: 589,056 (5)
abstracting: (p72<=1)
states: 138,549,515 (8)
abstracting: (1<=p78)
states: 7,410,432 (6)
abstracting: (p78<=1)
states: 138,549,515 (8)
abstracting: (1<=p78)
states: 7,410,432 (6)
abstracting: (p78<=1)
states: 138,549,515 (8)

before gc: list nodes free: 18220793

after gc: idd nodes used:4625389, unused:59374611; list nodes free:281514846
.
EG iterations: 1
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (0<=p49)
states: 138,549,515 (8)
abstracting: (p49<=0)
states: 103,912,139 (8)
abstracting: (1<=p12)
states: 4,474,368 (6)
abstracting: (p12<=1)
states: 138,549,515 (8)
abstracting: (0<=p24)
states: 138,549,515 (8)
abstracting: (p24<=0)
states: 132,837,899 (8)
abstracting: (1<=p60)
states: 34,637,376 (7)
abstracting: (p60<=1)
states: 138,549,515 (8)
abstracting: (0<=p39)
states: 138,549,515 (8)
abstracting: (p39<=0)
states: 128,814,347 (8)
abstracting: (1<=p16)
states: 6,457,344 (6)
abstracting: (p16<=1)
states: 138,549,515 (8)
abstracting: (0<=p98)
states: 138,549,515 (8)
abstracting: (p98<=0)
states: 138,487,307 (8)
abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p29)
states: 8,176,128 (6)
abstracting: (p29<=1)
states: 138,549,515 (8)
MC time: 3m57.244sec

checking: ~ [A [[[[[[0<=p120 & p120<=0] | [p77<=1 & 1<=p77]] & AX [[[p65<=0 & 0<=p65] | [p12<=1 & 1<=p12]]]] | EX [A [[[p90<=0 & 0<=p90] | [p5<=1 & 1<=p5]] U [p40<=1 & 1<=p40]]]] & EX [[[p19<=1 & 1<=p19] | [E [[p47<=1 & 1<=p47] U [[p107<=0 & 0<=p107] | [p91<=1 & 1<=p91]]] & EF [[p69<=1 & 1<=p69]]]]]] U ~ [EF [~ [[[p23<=0 & 0<=p23] & [[p22<=0 & 0<=p22] | [p31<=1 & 1<=p31]]]]]]]]
normalized: ~ [[~ [EG [E [true U ~ [[[[p31<=1 & 1<=p31] | [p22<=0 & 0<=p22]] & [p23<=0 & 0<=p23]]]]]] & ~ [E [E [true U ~ [[[[p31<=1 & 1<=p31] | [p22<=0 & 0<=p22]] & [p23<=0 & 0<=p23]]]] U [~ [[EX [[[E [true U [p69<=1 & 1<=p69]] & E [[p47<=1 & 1<=p47] U [[p91<=1 & 1<=p91] | [p107<=0 & 0<=p107]]]] | [p19<=1 & 1<=p19]]] & [EX [[~ [EG [~ [[p40<=1 & 1<=p40]]]] & ~ [E [~ [[p40<=1 & 1<=p40]] U [~ [[[p5<=1 & 1<=p5] | [p90<=0 & 0<=p90]]] & ~ [[p40<=1 & 1<=p40]]]]]]] | [~ [EX [~ [[[p12<=1 & 1<=p12] | [p65<=0 & 0<=p65]]]]] & [[p77<=1 & 1<=p77] | [0<=p120 & p120<=0]]]]]] & E [true U ~ [[[[p31<=1 & 1<=p31] | [p22<=0 & 0<=p22]] & [p23<=0 & 0<=p23]]]]]]]]]

abstracting: (0<=p23)
states: 138,549,515 (8)
abstracting: (p23<=0)
states: 132,228,875 (8)
abstracting: (0<=p22)
states: 138,549,515 (8)
abstracting: (p22<=0)
states: 132,681,227 (8)
abstracting: (1<=p31)
states: 10
abstracting: (p31<=1)
states: 138,549,515 (8)

before gc: list nodes free: 11738884

after gc: idd nodes used:5517279, unused:58482721; list nodes free:277538112
abstracting: (p120<=0)
states: 125,490,442 (8)
abstracting: (0<=p120)
states: 138,549,515 (8)
abstracting: (1<=p77)
states: 13,721,856 (7)
abstracting: (p77<=1)
states: 138,549,515 (8)
abstracting: (0<=p65)
states: 138,549,515 (8)
abstracting: (p65<=0)
states: 138,549,505 (8)
abstracting: (1<=p12)
states: 4,474,368 (6)
abstracting: (p12<=1)
states: 138,549,515 (8)
.abstracting: (1<=p40)
states: 10,000,896 (7)
abstracting: (p40<=1)
states: 138,549,515 (8)
abstracting: (0<=p90)
states: 138,549,515 (8)
abstracting: (p90<=0)
states: 135,784,715 (8)
abstracting: (1<=p5)
states: 10,403,328 (7)
abstracting: (p5<=1)
states: 138,549,515 (8)
abstracting: (1<=p40)
states: 10,000,896 (7)
abstracting: (p40<=1)
states: 138,549,515 (8)
MC time: 3m23.013sec

checking: EF [[[EF [[[p27<=0 & 0<=p27] | [p71<=0 & 0<=p71]]] & AX [[p14<=1 & 1<=p14]]] & [[p61<=1 & 1<=p61] & [[EF [[p50<=1 & 1<=p50]] | E [EX [[p42<=1 & 1<=p42]] U ~ [[[p73<=0 & 0<=p73] | [p33<=1 & 1<=p33]]]]] | [[[p100<=0 & 0<=p100] & [p1<=1 & 1<=p1]] | [[[p58<=0 & 0<=p58] & [p65<=1 & 1<=p65]] | [[p43<=1 & 1<=p43] & [[p6<=0 & 0<=p6] | [p34<=1 & 1<=p34]]]]]]]]]
normalized: E [true U [[[[[[[[p34<=1 & 1<=p34] | [p6<=0 & 0<=p6]] & [p43<=1 & 1<=p43]] | [[p65<=1 & 1<=p65] & [p58<=0 & 0<=p58]]] | [[p1<=1 & 1<=p1] & [p100<=0 & 0<=p100]]] | [E [EX [[p42<=1 & 1<=p42]] U ~ [[[p33<=1 & 1<=p33] | [p73<=0 & 0<=p73]]]] | E [true U [p50<=1 & 1<=p50]]]] & [p61<=1 & 1<=p61]] & [~ [EX [~ [[p14<=1 & 1<=p14]]]] & E [true U [[p71<=0 & 0<=p71] | [p27<=0 & 0<=p27]]]]]]

abstracting: (0<=p27)
states: 138,549,515 (8)
abstracting: (p27<=0)
states: 116,579,339 (8)
abstracting: (0<=p71)
states: 138,549,515 (8)
abstracting: (p71<=0)
states: 124,848,395 (8)
abstracting: (1<=p14)
states: 17,051,136 (7)
abstracting: (p14<=1)
states: 138,549,515 (8)
.abstracting: (1<=p61)
states: 34,637,376 (7)
abstracting: (p61<=1)
states: 138,549,515 (8)
abstracting: (1<=p50)
states: 34,637,376 (7)
abstracting: (p50<=1)
states: 138,549,515 (8)

before gc: list nodes free: 12283900

after gc: idd nodes used:6398523, unused:57601477; list nodes free:273631395
MC time: 2m54.762sec

checking: [EF [EX [EF [[p100<=1 & 1<=p100]]]] | EG [EX [[AG [[p114<=0 & 0<=p114]] & [[p77<=1 & 1<=p77] & [p62<=1 & 1<=p62]]]]]]
normalized: [EG [EX [[[[p62<=1 & 1<=p62] & [p77<=1 & 1<=p77]] & ~ [E [true U ~ [[p114<=0 & 0<=p114]]]]]]] | E [true U EX [E [true U [p100<=1 & 1<=p100]]]]]

abstracting: (1<=p100)
states: 7,140,096 (6)
abstracting: (p100<=1)
states: 138,549,515 (8)

before gc: list nodes free: 16855990

after gc: idd nodes used:7066174, unused:56933826; list nodes free:270765777
.abstracting: (0<=p114)
states: 138,549,515 (8)
abstracting: (p114<=0)
states: 138,549,514 (8)
abstracting: (1<=p77)
states: 13,721,856 (7)
abstracting: (p77<=1)
states: 138,549,515 (8)
abstracting: (1<=p62)
states: 34,637,376 (7)
abstracting: (p62<=1)
states: 138,549,515 (8)
...
EG iterations: 2
-> the formula is TRUE

FORMULA HealthRecord-PT-07-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m 5.224sec

checking: E [[[p75<=0 & 0<=p75] | [p101<=1 & 1<=p101]] U A [~ [EF [[p84<=0 & 0<=p84]]] U ~ [AX [[[p9<=0 & 0<=p9] | [p30<=1 & 1<=p30]]]]]]
normalized: E [[[p101<=1 & 1<=p101] | [p75<=0 & 0<=p75]] U [~ [EG [~ [EX [~ [[[p30<=1 & 1<=p30] | [p9<=0 & 0<=p9]]]]]]] & ~ [E [~ [EX [~ [[[p30<=1 & 1<=p30] | [p9<=0 & 0<=p9]]]]] U [E [true U [p84<=0 & 0<=p84]] & ~ [EX [~ [[[p30<=1 & 1<=p30] | [p9<=0 & 0<=p9]]]]]]]]]]

abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
.abstracting: (0<=p84)
states: 138,549,515 (8)
abstracting: (p84<=0)
states: 138,549,514 (8)

before gc: list nodes free: 15009171

after gc: idd nodes used:6723126, unused:57276874; list nodes free:272133611
abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
.abstracting: (0<=p9)
states: 138,549,515 (8)
abstracting: (p9<=0)
states: 128,304,395 (8)
abstracting: (1<=p30)
states: 6,008,832 (6)
abstracting: (p30<=1)
states: 138,549,515 (8)
..
EG iterations: 1
abstracting: (0<=p75)
states: 138,549,515 (8)
abstracting: (p75<=0)
states: 137,955,083 (8)
abstracting: (1<=p101)
states: 62,208 (4)
abstracting: (p101<=1)
states: 138,549,515 (8)

before gc: list nodes free: 8634252

after gc: idd nodes used:7025013, unused:56974987; list nodes free:270874103
-> the formula is TRUE

FORMULA HealthRecord-PT-07-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m17.211sec

checking: AX [[EF [[p11<=0 & 0<=p11]] & [~ [A [AF [[p10<=0 & 0<=p10]] U AG [[[p35<=0 & 0<=p35] | [p5<=1 & 1<=p5]]]]] | [[p52<=0 & 0<=p52] & [p3<=1 & 1<=p3]]]]]
normalized: ~ [EX [~ [[[~ [[~ [E [E [true U ~ [[[p35<=0 & 0<=p35] | [p5<=1 & 1<=p5]]]] U [E [true U ~ [[[p35<=0 & 0<=p35] | [p5<=1 & 1<=p5]]]] & EG [~ [[p10<=0 & 0<=p10]]]]]] & ~ [EG [E [true U ~ [[[p35<=0 & 0<=p35] | [p5<=1 & 1<=p5]]]]]]]] | [[p3<=1 & 1<=p3] & [p52<=0 & 0<=p52]]] & E [true U [p11<=0 & 0<=p11]]]]]]

abstracting: (0<=p11)
states: 138,549,515 (8)
abstracting: (p11<=0)
states: 128,304,395 (8)
abstracting: (0<=p52)
states: 138,549,515 (8)
abstracting: (p52<=0)
states: 138,549,505 (8)
abstracting: (1<=p3)
states: 10,404,864 (7)
abstracting: (p3<=1)
states: 138,549,515 (8)
abstracting: (1<=p5)
states: 10,403,328 (7)
abstracting: (p5<=1)
states: 138,549,515 (8)
abstracting: (0<=p35)
states: 138,549,515 (8)
abstracting: (p35<=0)
states: 134,312,459 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5856404 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098648 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 CTLCardinality -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

11145 16000
iterations count:204211 (887), effective:8892 (38)

initing FirstDep: 0m 0.000sec


iterations count:4065 (17), effective:273 (1)

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

iterations count:4081 (17), effective:269 (1)

iterations count:8376 (36), effective:624 (2)

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

sat_reach.icc:155: Timeout: after 320 sec


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

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

sat_reach.icc:155: Timeout: after 288 sec


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

iterations count:5722 (24), effective:410 (1)

iterations count:5722 (24), effective:410 (1)

iterations count:4121 (17), effective:273 (1)

sat_reach.icc:155: Timeout: after 259 sec


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

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

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

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

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

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

sat_reach.icc:155: Timeout: after 275 sec


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

iterations count:1245 (5), effective:97 (0)

iterations count:917 (3), effective:64 (0)

net_ddint.h:600: Timeout: after 236 sec


iterations count:6152 (26), effective:430 (1)

sat_reach.icc:155: Timeout: after 202 sec


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

sat_reach.icc:155: Timeout: after 173 sec


iterations count:8376 (36), effective:624 (2)

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

iterations count:7117 (30), effective:327 (1)

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

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

iterations count:4215 (18), effective:296 (1)

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

iterations count:5722 (24), effective:410 (1)

Sequence of Actions to be Executed by the VM

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

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

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