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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 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-06-CTLCardinality-00
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-01
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-02
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-03
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-04
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-05
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-06
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-07
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-08
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-09
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-10
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-11
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-12
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-13
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-14
FORMULA_NAME HealthRecord-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678683266787

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-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 04:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 04:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 04:54:29] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-13 04:54:29] [INFO ] Transformed 154 places.
[2023-03-13 04:54:29] [INFO ] Transformed 319 transitions.
[2023-03-13 04:54:29] [INFO ] Found NUPN structural information;
[2023-03-13 04:54:29] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-06-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 93 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 294/294 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 126 transition count 238
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 126 transition count 238
Applied a total of 56 rules in 30 ms. Remains 126 /154 variables (removed 28) and now considering 238/294 (removed 56) transitions.
[2023-03-13 04:54:29] [INFO ] Flow matrix only has 226 transitions (discarded 12 similar events)
// Phase 1: matrix 226 rows 126 cols
[2023-03-13 04:54:29] [INFO ] Computed 18 place invariants in 25 ms
[2023-03-13 04:54:29] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-13 04:54:29] [INFO ] Flow matrix only has 226 transitions (discarded 12 similar events)
[2023-03-13 04:54:30] [INFO ] Invariant cache hit.
[2023-03-13 04:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:54:30] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-13 04:54:30] [INFO ] Flow matrix only has 226 transitions (discarded 12 similar events)
[2023-03-13 04:54:30] [INFO ] Invariant cache hit.
[2023-03-13 04:54:30] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/154 places, 238/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 126/154 places, 238/294 transitions.
Support contains 93 out of 126 places after structural reductions.
[2023-03-13 04:54:31] [INFO ] Flatten gal took : 93 ms
[2023-03-13 04:54:31] [INFO ] Flatten gal took : 36 ms
[2023-03-13 04:54:31] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 92 out of 126 places (down from 93) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 508 resets, run finished after 855 ms. (steps per millisecond=11 ) properties (out of 69) seen :37
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) 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 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-13 04:54:32] [INFO ] Flow matrix only has 226 transitions (discarded 12 similar events)
[2023-03-13 04:54:32] [INFO ] Invariant cache hit.
[2023-03-13 04:54:32] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 04:54:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-13 04:54:32] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-13 04:54:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2023-03-13 04:54:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-13 04:54:34] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :29
[2023-03-13 04:54:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:54:34] [INFO ] After 505ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :29
[2023-03-13 04:54:35] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 11 ms to minimize.
[2023-03-13 04:54:35] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2023-03-13 04:54:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-13 04:54:35] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2023-03-13 04:54:35] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2023-03-13 04:54:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-03-13 04:54:36] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-13 04:54:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-13 04:54:36] [INFO ] After 2128ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :29
Attempting to minimize the solution found.
Minimization took 640 ms.
[2023-03-13 04:54:36] [INFO ] After 4207ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :29
Fused 31 Parikh solutions to 26 different solutions.
Parikh walk visited 1 properties in 96 ms.
Support contains 41 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 238/238 transitions.
Graph (trivial) has 103 edges and 126 vertex of which 10 / 126 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 540 edges and 121 vertex of which 118 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 213
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 116 transition count 209
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 14 place count 114 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 114 transition count 205
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 19 place count 111 transition count 205
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 45 place count 85 transition count 153
Iterating global reduction 3 with 26 rules applied. Total rules applied 71 place count 85 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 82 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 82 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 80 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 77 transition count 165
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 77 transition count 164
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 105 place count 77 transition count 164
Applied a total of 105 rules in 134 ms. Remains 77 /126 variables (removed 49) and now considering 164/238 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 77/126 places, 164/238 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 28) seen :5
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 164 rows 77 cols
[2023-03-13 04:54:37] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-13 04:54:38] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 04:54:38] [INFO ] [Real]Absence check using 1 positive and 13 generalized place invariants in 11 ms returned sat
[2023-03-13 04:54:38] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-13 04:54:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 04:54:38] [INFO ] [Nat]Absence check using 1 positive and 13 generalized place invariants in 13 ms returned sat
[2023-03-13 04:54:38] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-13 04:54:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-13 04:54:38] [INFO ] After 224ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-13 04:54:39] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 6 ms to minimize.
[2023-03-13 04:54:39] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2023-03-13 04:54:39] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-13 04:54:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 301 ms
[2023-03-13 04:54:39] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2023-03-13 04:54:39] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-13 04:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-03-13 04:54:39] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-13 04:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-13 04:54:39] [INFO ] After 1098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-13 04:54:39] [INFO ] After 1842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 13 properties in 81 ms.
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 164/164 transitions.
Graph (trivial) has 42 edges and 77 vertex of which 4 / 77 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 471 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 70 transition count 159
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 68 transition count 159
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 20 place count 53 transition count 128
Iterating global reduction 0 with 15 rules applied. Total rules applied 35 place count 53 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 50 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 50 transition count 124
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 47 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 46 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 46 transition count 125
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 46 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 45 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 45 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 45 transition count 118
Applied a total of 57 rules in 42 ms. Remains 45 /77 variables (removed 32) and now considering 118/164 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 45/77 places, 118/164 transitions.
Incomplete random walk after 10000 steps, including 1559 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 364 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 324 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 324 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 322 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Finished probabilistic random walk after 19317 steps, run visited all 5 properties in 197 ms. (steps per millisecond=98 )
Probabilistic random walk after 19317 steps, saw 4798 distinct states, run finished after 197 ms. (steps per millisecond=98 ) properties seen :5
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-13 04:54:40] [INFO ] Flatten gal took : 23 ms
[2023-03-13 04:54:40] [INFO ] Flatten gal took : 27 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 238 transitions.
Computed a total of 14 stabilizing places and 25 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 125
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 125
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 55 transition count 105
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 53 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 51 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 51 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 165 place count 51 transition count 80
Applied a total of 165 rules in 10 ms. Remains 51 /126 variables (removed 75) and now considering 80/238 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 51/126 places, 80/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 71 transition count 135
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 71 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 63 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 63 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 129 place count 63 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 61 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 61 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 59 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 59 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 142 place count 59 transition count 101
Applied a total of 142 rules in 9 ms. Remains 59 /126 variables (removed 67) and now considering 101/238 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 59/126 places, 101/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 125
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 125
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 55 transition count 105
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 52 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 52 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 49 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 49 transition count 81
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 172 place count 49 transition count 72
Applied a total of 172 rules in 8 ms. Remains 49 /126 variables (removed 77) and now considering 72/238 (removed 166) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 49/126 places, 72/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Graph (trivial) has 176 edges and 126 vertex of which 12 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 63 transition count 128
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 63 transition count 128
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 123 place count 53 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 133 place count 53 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 142 place count 53 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 145 place count 50 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 50 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 151 place count 47 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 154 place count 47 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 162 place count 47 transition count 76
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 47 transition count 70
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 172 place count 45 transition count 68
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 42 transition count 65
Applied a total of 175 rules in 37 ms. Remains 42 /126 variables (removed 84) and now considering 65/238 (removed 173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 42/126 places, 65/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 77 transition count 148
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 77 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 71 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 71 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 70 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 70 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 69 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 69 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 116 place count 69 transition count 129
Applied a total of 116 rules in 7 ms. Remains 69 /126 variables (removed 57) and now considering 129/238 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 69/126 places, 129/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 8 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 72 transition count 139
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 72 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 64 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 64 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 129 place count 64 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 62 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 62 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 60 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 60 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 60 transition count 102
Applied a total of 143 rules in 6 ms. Remains 60 /126 variables (removed 66) and now considering 102/238 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/126 places, 102/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 132
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 61 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 61 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 136 place count 61 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 59 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 59 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 57 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 57 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 150 place count 57 transition count 94
Applied a total of 150 rules in 5 ms. Remains 57 /126 variables (removed 69) and now considering 94/238 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 57/126 places, 94/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Graph (trivial) has 156 edges and 126 vertex of which 10 / 126 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 71 transition count 142
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 71 transition count 142
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 109 place count 63 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 117 place count 63 transition count 126
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 63 transition count 121
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 61 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 61 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 59 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 59 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 136 place count 59 transition count 105
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 59 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 56 transition count 97
Applied a total of 147 rules in 20 ms. Remains 56 /126 variables (removed 70) and now considering 97/238 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 56/126 places, 97/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 76 transition count 146
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 76 transition count 146
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 70 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 70 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 70 transition count 131
Applied a total of 115 rules in 3 ms. Remains 70 /126 variables (removed 56) and now considering 131/238 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 70/126 places, 131/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Graph (trivial) has 173 edges and 126 vertex of which 14 / 126 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 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 55 place count 65 transition count 132
Iterating global reduction 0 with 54 rules applied. Total rules applied 109 place count 65 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 118 place count 56 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 127 place count 56 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 132 place count 56 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 54 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 52 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 52 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 146 place count 52 transition count 93
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 52 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 165 place count 46 transition count 80
Applied a total of 165 rules in 19 ms. Remains 46 /126 variables (removed 80) and now considering 80/238 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 46/126 places, 80/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 74 transition count 139
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 74 transition count 139
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 65 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 65 transition count 121
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 130 place count 65 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 64 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 64 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 63 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 63 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 135 place count 63 transition count 107
Applied a total of 135 rules in 4 ms. Remains 63 /126 variables (removed 63) and now considering 107/238 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/126 places, 107/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 66 transition count 127
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 66 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 130 place count 56 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 140 place count 56 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 149 place count 56 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 53 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 53 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 158 place count 50 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 161 place count 50 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 169 place count 50 transition count 75
Applied a total of 169 rules in 4 ms. Remains 50 /126 variables (removed 76) and now considering 75/238 (removed 163) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/126 places, 75/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 125
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 56 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 56 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 146 place count 56 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 53 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 53 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 50 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 50 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 167 place count 50 transition count 77
Applied a total of 167 rules in 4 ms. Remains 50 /126 variables (removed 76) and now considering 77/238 (removed 161) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/126 places, 77/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 79 transition count 151
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 79 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 73 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 73 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 73 transition count 133
Applied a total of 112 rules in 3 ms. Remains 73 /126 variables (removed 53) and now considering 133/238 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 73/126 places, 133/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 11 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 238/238 transitions.
Graph (trivial) has 179 edges and 126 vertex of which 14 / 126 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 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 62 transition count 127
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 62 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 123 place count 52 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 133 place count 52 transition count 107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 141 place count 52 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 49 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 46 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 46 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 46 transition count 75
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 46 transition count 68
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 173 place count 44 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 40 transition count 62
Applied a total of 177 rules in 18 ms. Remains 40 /126 variables (removed 86) and now considering 62/238 (removed 176) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 40/126 places, 62/238 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 3 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 3 ms
[2023-03-13 04:54:41] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 12 ms
[2023-03-13 04:54:41] [INFO ] Flatten gal took : 10 ms
[2023-03-13 04:54:41] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 04:54:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 238 transitions and 673 arcs took 3 ms.
Total runtime 12424 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: 126 NrTr: 238 NrArc: 673)

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

net check time: 0m 0.000sec

init dd package: 0m 3.398sec


RS generation: 0m59.981sec


-> reachability set: #nodes 859780 (8.6e+05) #states 182,966,539 (8)



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

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

abstracting: (1<=p19)
states: 8,004,608 (6)
abstracting: (p19<=1)
states: 182,966,539 (8)
.-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m20.517sec

checking: AG [EF [AX [[p26<=0 & 0<=p26]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [[p26<=0 & 0<=p26]]]]]]]]

abstracting: (0<=p26)
states: 182,966,539 (8)
abstracting: (p26<=0)
states: 174,796,555 (8)
.-> the formula is TRUE

FORMULA HealthRecord-PT-06-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.521sec

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

abstracting: (0<=p4)
states: 182,966,539 (8)
abstracting: (p4<=0)
states: 165,227,787 (8)
.
before gc: list nodes free: 1773914

after gc: idd nodes used:1665546, unused:62334454; list nodes free:277411794
......
EG iterations: 7

before gc: list nodes free: 8885635

after gc: idd nodes used:1230112, unused:62769888; list nodes free:279878709
MC time: 4m23.066sec

checking: AG [AF [E [EF [[p48<=1 & 1<=p48]] U [p35<=1 & 1<=p35]]]]
normalized: ~ [E [true U EG [~ [E [E [true U [p48<=1 & 1<=p48]] U [p35<=1 & 1<=p35]]]]]]

abstracting: (1<=p35)
states: 13,678,080 (7)
abstracting: (p35<=1)
states: 182,966,539 (8)
abstracting: (1<=p48)
states: 45,741,632 (7)
abstracting: (p48<=1)
states: 182,966,539 (8)

before gc: list nodes free: 6270899

after gc: idd nodes used:1929768, unused:62070232; list nodes free:276910165
.
EG iterations: 1
MC time: 4m 3.320sec

checking: AX [AG [[[p37<=0 & 0<=p37] | [p58<=1 & 1<=p58]]]]
normalized: ~ [EX [E [true U ~ [[[p58<=1 & 1<=p58] | [p37<=0 & 0<=p37]]]]]]

abstracting: (0<=p37)
states: 182,966,539 (8)
abstracting: (p37<=0)
states: 169,410,059 (8)
abstracting: (1<=p58)
states: 45,741,632 (7)
abstracting: (p58<=1)
states: 182,966,539 (8)

before gc: list nodes free: 4762854

after gc: idd nodes used:2105739, unused:61894261; list nodes free:276188294
MC time: 3m44.156sec

checking: EF [[AF [AX [[p69<=1 & 1<=p69]]] & [p49<=1 & 1<=p49]]]
normalized: E [true U [[p49<=1 & 1<=p49] & ~ [EG [EX [~ [[p69<=1 & 1<=p69]]]]]]]

abstracting: (1<=p69)
states: 15,931,392 (7)
abstracting: (p69<=1)
states: 182,966,539 (8)
.
before gc: list nodes free: 1346968

after gc: idd nodes used:2483597, unused:61516403; list nodes free:274584378
......
EG iterations: 6
abstracting: (1<=p49)
states: 45,741,632 (7)
abstracting: (p49<=1)
states: 182,966,539 (8)
-> the formula is FALSE

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

MC time: 2m16.095sec

checking: ~ [E [[p107<=0 & 0<=p107] U AG [A [[p11<=1 & 1<=p11] U [[p69<=0 & 0<=p69] | [p30<=1 & 1<=p30]]]]]]
normalized: ~ [E [[p107<=0 & 0<=p107] U ~ [E [true U ~ [[~ [EG [~ [[[p30<=1 & 1<=p30] | [p69<=0 & 0<=p69]]]]] & ~ [E [~ [[[p30<=1 & 1<=p30] | [p69<=0 & 0<=p69]]] U [~ [[p11<=1 & 1<=p11]] & ~ [[[p30<=1 & 1<=p30] | [p69<=0 & 0<=p69]]]]]]]]]]]]

abstracting: (0<=p69)
states: 182,966,539 (8)
abstracting: (p69<=0)
states: 167,035,147 (8)
abstracting: (1<=p30)
states: 13,637,632 (7)
abstracting: (p30<=1)
states: 182,966,539 (8)
abstracting: (1<=p11)
states: 8,914,432 (6)
abstracting: (p11<=1)
states: 182,966,539 (8)
abstracting: (0<=p69)
states: 182,966,539 (8)
abstracting: (p69<=0)
states: 167,035,147 (8)
abstracting: (1<=p30)
states: 13,637,632 (7)
abstracting: (p30<=1)
states: 182,966,539 (8)
abstracting: (0<=p69)
states: 182,966,539 (8)
abstracting: (p69<=0)
states: 167,035,147 (8)
abstracting: (1<=p30)
states: 13,637,632 (7)
abstracting: (p30<=1)
states: 182,966,539 (8)
.......
EG iterations: 7

before gc: list nodes free: 1185862

after gc: idd nodes used:3306584, unused:60693416; list nodes free:273079587
MC time: 3m32.090sec

checking: AX [AG [[[p78<=0 & 0<=p78] | [AF [[p31<=0 & 0<=p31]] & [[[p36<=0 & 0<=p36] | [p42<=1 & 1<=p42]] & [[p99<=0 & 0<=p99] | [[p31<=1 & 1<=p31] | [p91<=1 & 1<=p91]]]]]]]]
normalized: ~ [EX [E [true U ~ [[[[[[[p91<=1 & 1<=p91] | [p31<=1 & 1<=p31]] | [p99<=0 & 0<=p99]] & [[p42<=1 & 1<=p42] | [p36<=0 & 0<=p36]]] & ~ [EG [~ [[p31<=0 & 0<=p31]]]]] | [p78<=0 & 0<=p78]]]]]]

abstracting: (0<=p78)
states: 182,966,539 (8)
abstracting: (p78<=0)
states: 168,802,315 (8)
abstracting: (0<=p31)
states: 182,966,539 (8)
abstracting: (p31<=0)
states: 169,410,059 (8)
.......
EG iterations: 7
abstracting: (0<=p36)
states: 182,966,539 (8)
abstracting: (p36<=0)
states: 169,410,059 (8)
abstracting: (1<=p42)
states: 10
abstracting: (p42<=1)
states: 182,966,539 (8)
abstracting: (0<=p99)
states: 182,966,539 (8)
abstracting: (p99<=0)
states: 179,487,499 (8)
abstracting: (1<=p31)
states: 13,556,480 (7)
abstracting: (p31<=1)
states: 182,966,539 (8)
abstracting: (1<=p91)
states: 3,479,040 (6)
abstracting: (p91<=1)
states: 182,966,539 (8)

before gc: list nodes free: 7969034

after gc: idd nodes used:4380079, unused:59619921; list nodes free:268477448
MC time: 3m15.092sec

checking: A [E [AX [~ [AX [[p42<=1 & 1<=p42]]]] U [p75<=1 & 1<=p75]] U E [EX [[[p33<=0 & 0<=p33] | ~ [AF [[[p33<=0 & 0<=p33] | [p62<=1 & 1<=p62]]]]]] U [A [AX [[p84<=0 & 0<=p84]] U EF [[[p36<=0 & 0<=p36] | [p63<=1 & 1<=p63]]]] & E [[p45<=1 & 1<=p45] U [[p117<=1 & 1<=p117] | AG [[p89<=0 & 0<=p89]]]]]]]
normalized: [~ [EG [~ [E [EX [[EG [~ [[[p62<=1 & 1<=p62] | [p33<=0 & 0<=p33]]]] | [p33<=0 & 0<=p33]]] U [E [[p45<=1 & 1<=p45] U [~ [E [true U ~ [[p89<=0 & 0<=p89]]]] | [p117<=1 & 1<=p117]]] & [~ [EG [~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]]]] & ~ [E [~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]] U [EX [~ [[p84<=0 & 0<=p84]]] & ~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]]]]]]]]]]] & ~ [E [~ [E [EX [[EG [~ [[[p62<=1 & 1<=p62] | [p33<=0 & 0<=p33]]]] | [p33<=0 & 0<=p33]]] U [E [[p45<=1 & 1<=p45] U [~ [E [true U ~ [[p89<=0 & 0<=p89]]]] | [p117<=1 & 1<=p117]]] & [~ [EG [~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]]]] & ~ [E [~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]] U [EX [~ [[p84<=0 & 0<=p84]]] & ~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]]]]]]]]] U [~ [E [~ [EX [~ [EX [~ [[p42<=1 & 1<=p42]]]]]] U [p75<=1 & 1<=p75]]] & ~ [E [EX [[EG [~ [[[p62<=1 & 1<=p62] | [p33<=0 & 0<=p33]]]] | [p33<=0 & 0<=p33]]] U [E [[p45<=1 & 1<=p45] U [~ [E [true U ~ [[p89<=0 & 0<=p89]]]] | [p117<=1 & 1<=p117]]] & [~ [EG [~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]]]] & ~ [E [~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]] U [EX [~ [[p84<=0 & 0<=p84]]] & ~ [E [true U [[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]]]]]]]]]]]]]]]

abstracting: (0<=p36)
states: 182,966,539 (8)
abstracting: (p36<=0)
states: 169,410,059 (8)
abstracting: (1<=p63)
states: 27,936,768 (7)
abstracting: (p63<=1)
states: 182,966,539 (8)
abstracting: (0<=p84)
states: 182,966,539 (8)
abstracting: (p84<=0)
states: 153,612,043 (8)

before gc: list nodes free: 7300534

after gc: idd nodes used:5650823, unused:58349177; list nodes free:262848315
MC time: 3m 0.294sec

checking: [E [~ [AF [~ [AG [[p10<=1 & 1<=p10]]]]] U [~ [AG [[[p83<=0 & 0<=p83] & [[p92<=0 & 0<=p92] | [p99<=1 & 1<=p99]]]]] & AF [[p91<=0 & 0<=p91]]]] & A [E [~ [A [[p82<=1 & 1<=p82] U [p4<=1 & 1<=p4]]] U ~ [[[p63<=0 & 0<=p63] | [p115<=1 & 1<=p115]]]] U ~ [EX [E [[[p76<=0 & 0<=p76] | [p64<=1 & 1<=p64]] U [p14<=1 & 1<=p14]]]]]]
normalized: [[~ [EG [EX [E [[[p64<=1 & 1<=p64] | [p76<=0 & 0<=p76]] U [p14<=1 & 1<=p14]]]]] & ~ [E [EX [E [[[p64<=1 & 1<=p64] | [p76<=0 & 0<=p76]] U [p14<=1 & 1<=p14]]] U [~ [E [~ [[~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[p82<=1 & 1<=p82]] & ~ [[p4<=1 & 1<=p4]]]]]]] U ~ [[[p115<=1 & 1<=p115] | [p63<=0 & 0<=p63]]]]] & EX [E [[[p64<=1 & 1<=p64] | [p76<=0 & 0<=p76]] U [p14<=1 & 1<=p14]]]]]]] & E [EG [~ [E [true U ~ [[p10<=1 & 1<=p10]]]]] U [~ [EG [~ [[p91<=0 & 0<=p91]]]] & E [true U ~ [[[[p99<=1 & 1<=p99] | [p92<=0 & 0<=p92]] & [p83<=0 & 0<=p83]]]]]]]

abstracting: (0<=p83)
states: 182,966,539 (8)
abstracting: (p83<=0)
states: 182,966,538 (8)
abstracting: (0<=p92)
states: 182,966,539 (8)
abstracting: (p92<=0)
states: 172,463,115 (8)
abstracting: (1<=p99)
states: 3,479,040 (6)
abstracting: (p99<=1)
states: 182,966,539 (8)
MC time: 2m43.052sec

checking: [EF [[[p118<=0 & 0<=p118] | [p77<=1 & 1<=p77]]] & E [[[p19<=0 & 0<=p19] | [p56<=1 & 1<=p56]] U ~ [EG [A [A [[[p48<=0 & 0<=p48] | [p16<=1 & 1<=p16]] U [[p94<=0 & 0<=p94] | [p58<=1 & 1<=p58]]] U [[[p38<=0 & 0<=p38] | [p22<=1 & 1<=p22]] | [[p63<=0 & 0<=p63] | [p90<=1 & 1<=p90]]]]]]]]
normalized: [E [[[p56<=1 & 1<=p56] | [p19<=0 & 0<=p19]] U ~ [EG [[~ [EG [~ [[[[p90<=1 & 1<=p90] | [p63<=0 & 0<=p63]] | [[p22<=1 & 1<=p22] | [p38<=0 & 0<=p38]]]]]] & ~ [E [~ [[[[p90<=1 & 1<=p90] | [p63<=0 & 0<=p63]] | [[p22<=1 & 1<=p22] | [p38<=0 & 0<=p38]]]] U [~ [[~ [EG [~ [[[p58<=1 & 1<=p58] | [p94<=0 & 0<=p94]]]]] & ~ [E [~ [[[p58<=1 & 1<=p58] | [p94<=0 & 0<=p94]]] U [~ [[[p16<=1 & 1<=p16] | [p48<=0 & 0<=p48]]] & ~ [[[p58<=1 & 1<=p58] | [p94<=0 & 0<=p94]]]]]]]] & ~ [[[[p90<=1 & 1<=p90] | [p63<=0 & 0<=p63]] | [[p22<=1 & 1<=p22] | [p38<=0 & 0<=p38]]]]]]]]]]] & E [true U [[p77<=1 & 1<=p77] | [p118<=0 & 0<=p118]]]]

abstracting: (0<=p118)
states: 182,966,539 (8)
abstracting: (p118<=0)
states: 182,904,331 (8)
abstracting: (1<=p77)
states: 2,759,424 (6)
abstracting: (p77<=1)
states: 182,966,539 (8)

before gc: list nodes free: 7005735

after gc: idd nodes used:5356657, unused:58643343; list nodes free:264253695
abstracting: (0<=p38)
states: 182,966,539 (8)
abstracting: (p38<=0)
states: 176,156,171 (8)
abstracting: (1<=p22)
states: 14,053,888 (7)
abstracting: (p22<=1)
states: 182,966,539 (8)
abstracting: (0<=p63)
states: 182,966,539 (8)
abstracting: (p63<=0)
states: 155,029,771 (8)
abstracting: (1<=p90)
states: 10,497,280 (7)
abstracting: (p90<=1)
states: 182,966,539 (8)
abstracting: (0<=p94)
states: 182,966,539 (8)
abstracting: (p94<=0)
states: 182,862,859 (8)
abstracting: (1<=p58)
states: 45,741,632 (7)
abstracting: (p58<=1)
states: 182,966,539 (8)
abstracting: (0<=p48)
states: 182,966,539 (8)
abstracting: (p48<=0)
states: 137,224,907 (8)
abstracting: (1<=p16)
states: 13,932,544 (7)
abstracting: (p16<=1)
states: 182,966,539 (8)
abstracting: (0<=p94)
states: 182,966,539 (8)
abstracting: (p94<=0)
states: 182,862,859 (8)
abstracting: (1<=p58)
states: 45,741,632 (7)
abstracting: (p58<=1)
states: 182,966,539 (8)
abstracting: (0<=p94)
states: 182,966,539 (8)
abstracting: (p94<=0)
states: 182,862,859 (8)
abstracting: (1<=p58)
states: 45,741,632 (7)
abstracting: (p58<=1)
states: 182,966,539 (8)
.....
EG iterations: 5
abstracting: (0<=p38)
states: 182,966,539 (8)
abstracting: (p38<=0)
states: 176,156,171 (8)
abstracting: (1<=p22)
states: 14,053,888 (7)
abstracting: (p22<=1)
states: 182,966,539 (8)
abstracting: (0<=p63)
states: 182,966,539 (8)
abstracting: (p63<=0)
states: 155,029,771 (8)
abstracting: (1<=p90)
states: 10,497,280 (7)
abstracting: (p90<=1)
states: 182,966,539 (8)
abstracting: (0<=p38)
states: 182,966,539 (8)
abstracting: (p38<=0)
states: 176,156,171 (8)
abstracting: (1<=p22)
states: 14,053,888 (7)
abstracting: (p22<=1)
states: 182,966,539 (8)
abstracting: (0<=p63)
states: 182,966,539 (8)
abstracting: (p63<=0)
states: 155,029,771 (8)
abstracting: (1<=p90)
states: 10,497,280 (7)
abstracting: (p90<=1)
states: 182,966,539 (8)
......
EG iterations: 6
MC time: 2m30.439sec

checking: [EF [[[[p68<=0 & 0<=p68] | [p41<=1 & 1<=p41]] & [EX [[[p6<=0 & 0<=p6] | [p11<=1 & 1<=p11]]] & [EG [[p39<=1 & 1<=p39]] | [p102<=0 & 0<=p102]]]]] & AG [[E [AG [~ [[[p55<=0 & 0<=p55] | [p8<=1 & 1<=p8]]]] U [~ [EG [[[p38<=0 & 0<=p38] | [p62<=1 & 1<=p62]]]] & EX [[p28<=1 & 1<=p28]]]] | AF [E [[p34<=0 & 0<=p34] U [p47<=0 & 0<=p47]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [E [[p34<=0 & 0<=p34] U [p47<=0 & 0<=p47]]]]] | E [~ [E [true U [[p8<=1 & 1<=p8] | [p55<=0 & 0<=p55]]]] U [EX [[p28<=1 & 1<=p28]] & ~ [EG [[[p62<=1 & 1<=p62] | [p38<=0 & 0<=p38]]]]]]]]]] & E [true U [[[[p102<=0 & 0<=p102] | EG [[p39<=1 & 1<=p39]]] & EX [[[p11<=1 & 1<=p11] | [p6<=0 & 0<=p6]]]] & [[p41<=1 & 1<=p41] | [p68<=0 & 0<=p68]]]]]

abstracting: (0<=p68)
states: 182,966,539 (8)
abstracting: (p68<=0)
states: 182,966,535 (8)
abstracting: (1<=p41)
states: 22,154,752 (7)
abstracting: (p41<=1)
states: 182,966,539 (8)
abstracting: (0<=p6)
states: 182,966,539 (8)
abstracting: (p6<=0)
states: 172,842,251 (8)
abstracting: (1<=p11)
states: 8,914,432 (6)
abstracting: (p11<=1)
states: 182,966,539 (8)
.abstracting: (1<=p39)
states: 13,678,080 (7)
abstracting: (p39<=1)
states: 182,966,539 (8)
.......
EG iterations: 7
abstracting: (0<=p102)
states: 182,966,539 (8)
abstracting: (p102<=0)
states: 182,862,859 (8)
abstracting: (0<=p38)
states: 182,966,539 (8)
abstracting: (p38<=0)
states: 176,156,171 (8)
abstracting: (1<=p62)
states: 10
abstracting: (p62<=1)
states: 182,966,539 (8)
MC time: 2m17.062sec

checking: [AG [[EF [[p104<=1 & 1<=p104]] | [EX [[~ [[p31<=1 & 1<=p31]] & [~ [[p48<=0 & 0<=p48]] & ~ [[p121<=1 & 1<=p121]]]]] & EF [AG [[~ [[p17<=0 & 0<=p17]] & ~ [[p20<=1 & 1<=p20]]]]]]]] & ~ [A [[AX [[[[p122<=0 & 0<=p122] | [[p32<=1 & 1<=p32] | [p20<=0 & 0<=p20]]] | [[p91<=1 & 1<=p91] | [[p37<=0 & 0<=p37] | [p1<=1 & 1<=p1]]]]] | ~ [[[p30<=0 & 0<=p30] | [p69<=1 & 1<=p69]]]] U ~ [AX [[[p111<=0 & 0<=p111] | [[p120<=1 & 1<=p120] | [p74<=1 & 1<=p74]]]]]]]]
normalized: [~ [[~ [EG [~ [EX [~ [[[[p74<=1 & 1<=p74] | [p120<=1 & 1<=p120]] | [p111<=0 & 0<=p111]]]]]]] & ~ [E [~ [EX [~ [[[[p74<=1 & 1<=p74] | [p120<=1 & 1<=p120]] | [p111<=0 & 0<=p111]]]]] U [~ [[~ [[[p69<=1 & 1<=p69] | [p30<=0 & 0<=p30]]] | ~ [EX [~ [[[[[p1<=1 & 1<=p1] | [p37<=0 & 0<=p37]] | [p91<=1 & 1<=p91]] | [[[p20<=0 & 0<=p20] | [p32<=1 & 1<=p32]] | [p122<=0 & 0<=p122]]]]]]]] & ~ [EX [~ [[[[p74<=1 & 1<=p74] | [p120<=1 & 1<=p120]] | [p111<=0 & 0<=p111]]]]]]]]]] & ~ [E [true U ~ [[[E [true U ~ [E [true U ~ [[~ [[p20<=1 & 1<=p20]] & ~ [[p17<=0 & 0<=p17]]]]]]] & EX [[[~ [[p121<=1 & 1<=p121]] & ~ [[p48<=0 & 0<=p48]]] & ~ [[p31<=1 & 1<=p31]]]]] | E [true U [p104<=1 & 1<=p104]]]]]]]

abstracting: (1<=p104)
states: 10,490,368 (7)
abstracting: (p104<=1)
states: 182,966,539 (8)

before gc: list nodes free: 4536328

after gc: idd nodes used:6368126, unused:57631874; list nodes free:259868523
MC time: 2m 6.018sec

checking: [EX [[AX [AG [E [[[p21<=0 & 0<=p21] | [p125<=1 & 1<=p125]] U [p15<=1 & 1<=p15]]]] | [[[E [[[p102<=0 & 0<=p102] | [p20<=1 & 1<=p20]] U [p49<=0 & 0<=p49]] | [[[p86<=0 & 0<=p86] | [p31<=1 & 1<=p31]] & [[p61<=0 & 0<=p61] | [p84<=1 & 1<=p84]]]] & ~ [A [EF [[[p43<=0 & 0<=p43] | [p98<=1 & 1<=p98]]] U ~ [[p13<=1 & 1<=p13]]]]] & [[p24<=0 & 0<=p24] & [p106<=1 & 1<=p106]]]]] & EG [EX [[[AX [1<=0] | [p53<=0 & 0<=p53]] | [[p112<=1 & 1<=p112] | [[p7<=0 & 0<=p7] | [p30<=1 & 1<=p30]]]]]]]
normalized: [EX [[~ [EX [E [true U ~ [E [[[p125<=1 & 1<=p125] | [p21<=0 & 0<=p21]] U [p15<=1 & 1<=p15]]]]]] | [[[E [[[p20<=1 & 1<=p20] | [p102<=0 & 0<=p102]] U [p49<=0 & 0<=p49]] | [[[p84<=1 & 1<=p84] | [p61<=0 & 0<=p61]] & [[p31<=1 & 1<=p31] | [p86<=0 & 0<=p86]]]] & ~ [[~ [EG [[p13<=1 & 1<=p13]]] & ~ [E [[p13<=1 & 1<=p13] U [~ [E [true U [[p98<=1 & 1<=p98] | [p43<=0 & 0<=p43]]]] & [p13<=1 & 1<=p13]]]]]]] & [[p106<=1 & 1<=p106] & [p24<=0 & 0<=p24]]]]] & EG [EX [[[[[p30<=1 & 1<=p30] | [p7<=0 & 0<=p7]] | [p112<=1 & 1<=p112]] | [[p53<=0 & 0<=p53] | ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (0<=p53)
states: 182,966,539 (8)
abstracting: (p53<=0)
states: 137,224,907 (8)
abstracting: (1<=p112)
states: 10,490,368 (7)
abstracting: (p112<=1)
states: 182,966,539 (8)
abstracting: (0<=p7)
states: 182,966,539 (8)
abstracting: (p7<=0)
states: 165,071,371 (8)
abstracting: (1<=p30)
states: 13,637,632 (7)
abstracting: (p30<=1)
states: 182,966,539 (8)
.......
EG iterations: 6
abstracting: (0<=p24)
states: 182,966,539 (8)
abstracting: (p24<=0)
states: 159,721,227 (8)
abstracting: (1<=p106)
states: 103,680 (5)
abstracting: (p106<=1)
states: 182,966,539 (8)
abstracting: (1<=p13)
states: 10
abstracting: (p13<=1)
states: 182,966,539 (8)
abstracting: (0<=p43)
states: 182,966,539 (8)
abstracting: (p43<=0)
states: 137,224,907 (8)
abstracting: (1<=p98)
states: 103,680 (5)
abstracting: (p98<=1)
states: 182,966,539 (8)
MC time: 1m55.411sec

checking: E [~ [[AG [[p43<=1 & 1<=p43]] | EF [AX [[[p61<=0 & 0<=p61] | [p47<=1 & 1<=p47]]]]]] U [[AG [EF [AX [[[p74<=0 & 0<=p74] | [p59<=1 & 1<=p59]]]]] & [AG [EF [[[p109<=0 & 0<=p109] | [p73<=1 & 1<=p73]]]] | [[p119<=0 & 0<=p119] | [[[p72<=1 & 1<=p72] & ~ [[[p70<=0 & 0<=p70] | [p63<=1 & 1<=p63]]]] & [[p76<=1 & 1<=p76] & [[[p104<=0 & 0<=p104] | ~ [[[p101<=0 & 0<=p101] | [p44<=1 & 1<=p44]]]] | [[p42<=0 & 0<=p42] | [p51<=1 & 1<=p51]]]]]]]] | [~ [EF [[~ [[[p37<=0 & 0<=p37] | [p103<=1 & 1<=p103]]] & [p19<=1 & 1<=p19]]]] & ~ [EX [[p124<=1 & 1<=p124]]]]]]
normalized: E [~ [[E [true U ~ [EX [~ [[[p47<=1 & 1<=p47] | [p61<=0 & 0<=p61]]]]]] | ~ [E [true U ~ [[p43<=1 & 1<=p43]]]]]] U [[[[[[[[[p51<=1 & 1<=p51] | [p42<=0 & 0<=p42]] | [~ [[[p44<=1 & 1<=p44] | [p101<=0 & 0<=p101]]] | [p104<=0 & 0<=p104]]] & [p76<=1 & 1<=p76]] & [~ [[[p63<=1 & 1<=p63] | [p70<=0 & 0<=p70]]] & [p72<=1 & 1<=p72]]] | [p119<=0 & 0<=p119]] | ~ [E [true U ~ [E [true U [[p73<=1 & 1<=p73] | [p109<=0 & 0<=p109]]]]]]] & ~ [E [true U ~ [E [true U ~ [EX [~ [[[p59<=1 & 1<=p59] | [p74<=0 & 0<=p74]]]]]]]]]] | [~ [EX [[p124<=1 & 1<=p124]]] & ~ [E [true U [[p19<=1 & 1<=p19] & ~ [[[p103<=1 & 1<=p103] | [p37<=0 & 0<=p37]]]]]]]]]

abstracting: (0<=p37)
states: 182,966,539 (8)
abstracting: (p37<=0)
states: 169,410,059 (8)
abstracting: (1<=p103)
states: 3,479,040 (6)
abstracting: (p103<=1)
states: 182,966,539 (8)
abstracting: (1<=p19)
states: 8,004,608 (6)
abstracting: (p19<=1)
states: 182,966,539 (8)

before gc: list nodes free: 4004167

after gc: idd nodes used:7300224, unused:56699776; list nodes free:255878753
MC time: 1m46.002sec

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

abstracting: (0<=p4)
states: 182,966,539 (8)
abstracting: (p4<=0)
states: 165,227,787 (8)
.......
EG iterations: 7

before gc: list nodes free: 10024879

after gc: idd nodes used:7363370, unused:56636630; list nodes free:255557502

before gc: list nodes free: 12066219

after gc: idd nodes used:7796778, unused:56203222; list nodes free:253724549
-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m 0.393sec

checking: AG [AF [E [EF [[p48<=1 & 1<=p48]] U [p35<=1 & 1<=p35]]]]
normalized: ~ [E [true U EG [~ [E [E [true U [p48<=1 & 1<=p48]] U [p35<=1 & 1<=p35]]]]]]

abstracting: (1<=p35)
states: 13,678,080 (7)
abstracting: (p35<=1)
states: 182,966,539 (8)
abstracting: (1<=p48)
states: 45,741,632 (7)
abstracting: (p48<=1)
states: 182,966,539 (8)

before gc: list nodes free: 7137379

after gc: idd nodes used:7350790, unused:56649210; list nodes free:255653090
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6077980 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100608 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

21935 22677 31263
iterations count:358165 (1504), effective:9324 (39)

initing FirstDep: 0m 0.000sec


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

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

sat_reach.icc:155: Timeout: after 262 sec


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

iterations count:6606 (27), effective:326 (1)

sat_reach.icc:155: Timeout: after 242 sec


sat_reach.icc:155: Timeout: after 223 sec


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

sat_reach.icc:155: Timeout: after 211 sec


sat_reach.icc:155: Timeout: after 194 sec


iterations count:2290 (9), effective:104 (0)

net_ddint.h:600: Timeout: after 177 sec


sat_reach.icc:155: Timeout: after 162 sec


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

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

net_ddint.h:600: Timeout: after 149 sec


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

net_ddint.h:600: Timeout: after 136 sec


sat_reach.icc:155: Timeout: after 125 sec


sat_reach.icc:155: Timeout: after 114 sec


sat_reach.icc:155: Timeout: after 105 sec


iterations count:4688 (19), effective:231 (0)

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

iterations count:6606 (27), effective:326 (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-06"
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-06, 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-167840348400273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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