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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678701314314

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-12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:55:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:55:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:55:17] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-13 09:55:17] [INFO ] Transformed 160 places.
[2023-03-13 09:55:17] [INFO ] Transformed 340 transitions.
[2023-03-13 09:55:17] [INFO ] Found NUPN structural information;
[2023-03-13 09:55:17] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-12-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 125 transition count 245
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 125 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 124 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 124 transition count 243
Applied a total of 72 rules in 34 ms. Remains 124 /160 variables (removed 36) and now considering 243/312 (removed 69) transitions.
[2023-03-13 09:55:17] [INFO ] Flow matrix only has 234 transitions (discarded 9 similar events)
// Phase 1: matrix 234 rows 124 cols
[2023-03-13 09:55:17] [INFO ] Computed 15 place invariants in 37 ms
[2023-03-13 09:55:18] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-13 09:55:18] [INFO ] Flow matrix only has 234 transitions (discarded 9 similar events)
[2023-03-13 09:55:18] [INFO ] Invariant cache hit.
[2023-03-13 09:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:55:18] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-03-13 09:55:18] [INFO ] Flow matrix only has 234 transitions (discarded 9 similar events)
[2023-03-13 09:55:18] [INFO ] Invariant cache hit.
[2023-03-13 09:55:18] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/160 places, 243/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 124/160 places, 243/312 transitions.
Support contains 92 out of 124 places after structural reductions.
[2023-03-13 09:55:19] [INFO ] Flatten gal took : 68 ms
[2023-03-13 09:55:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA HealthRecord-PT-12-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:55:19] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:55:19] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 90 out of 124 places (down from 92) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 718 resets, run finished after 883 ms. (steps per millisecond=11 ) properties (out of 66) seen :27
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) 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 38) seen :0
Running SMT prover for 38 properties.
[2023-03-13 09:55:20] [INFO ] Flow matrix only has 234 transitions (discarded 9 similar events)
[2023-03-13 09:55:20] [INFO ] Invariant cache hit.
[2023-03-13 09:55:20] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-13 09:55:20] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-13 09:55:20] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-13 09:55:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-13 09:55:21] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-13 09:55:22] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :36
[2023-03-13 09:55:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:55:22] [INFO ] After 511ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :36
[2023-03-13 09:55:22] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 10 ms to minimize.
[2023-03-13 09:55:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-13 09:55:23] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2023-03-13 09:55:23] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2023-03-13 09:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-13 09:55:23] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2023-03-13 09:55:23] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2023-03-13 09:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-03-13 09:55:23] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2023-03-13 09:55:23] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2023-03-13 09:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-13 09:55:24] [INFO ] After 2108ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :34
Attempting to minimize the solution found.
Minimization took 569 ms.
[2023-03-13 09:55:24] [INFO ] After 3802ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :34
Fused 38 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 46 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 243/243 transitions.
Graph (trivial) has 86 edges and 124 vertex of which 6 / 124 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 530 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 119 transition count 224
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 116 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 116 transition count 220
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 115 transition count 220
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 34 place count 94 transition count 178
Iterating global reduction 2 with 21 rules applied. Total rules applied 55 place count 94 transition count 178
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 91 transition count 172
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 91 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 91 transition count 168
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 69 place count 89 transition count 166
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 79 place count 84 transition count 190
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 84 transition count 187
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 84 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 82 transition count 185
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 104 place count 82 transition count 185
Applied a total of 104 rules in 132 ms. Remains 82 /124 variables (removed 42) and now considering 185/243 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 82/124 places, 185/243 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 34) seen :8
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 09:55:25] [INFO ] Flow matrix only has 175 transitions (discarded 10 similar events)
// Phase 1: matrix 175 rows 82 cols
[2023-03-13 09:55:25] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-13 09:55:25] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 09:55:25] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 09:55:25] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-13 09:55:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-13 09:55:26] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 09:55:26] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-13 09:55:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-13 09:55:26] [INFO ] After 178ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-13 09:55:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-13 09:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-13 09:55:26] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2023-03-13 09:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-13 09:55:26] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-13 09:55:27] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2023-03-13 09:55:27] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2023-03-13 09:55:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2023-03-13 09:55:27] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-03-13 09:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-13 09:55:27] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2023-03-13 09:55:27] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-13 09:55:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-13 09:55:27] [INFO ] After 1189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-13 09:55:27] [INFO ] After 1798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 5 ms.
Support contains 29 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 185/185 transitions.
Graph (trivial) has 23 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 456 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 72 transition count 174
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 72 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 72 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 70 transition count 171
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 67 transition count 179
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 67 transition count 177
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 67 transition count 177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 66 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 66 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 65 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 65 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 65 transition count 171
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 65 transition count 167
Applied a total of 37 rules in 69 ms. Remains 65 /82 variables (removed 17) and now considering 167/185 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 65/82 places, 167/185 transitions.
Incomplete random walk after 10000 steps, including 661 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-13 09:55:28] [INFO ] Flow matrix only has 153 transitions (discarded 14 similar events)
// Phase 1: matrix 153 rows 65 cols
[2023-03-13 09:55:28] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-13 09:55:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 09:55:28] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 09:55:28] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-13 09:55:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 09:55:28] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 09:55:29] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-13 09:55:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-13 09:55:29] [INFO ] After 149ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-13 09:55:29] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-13 09:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-13 09:55:29] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-13 09:55:29] [INFO ] After 975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 2 ms.
Support contains 25 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 167/167 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 63 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 62 transition count 167
Applied a total of 6 rules in 14 ms. Remains 62 /65 variables (removed 3) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 62/65 places, 167/167 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-13 09:55:30] [INFO ] Flow matrix only has 153 transitions (discarded 14 similar events)
// Phase 1: matrix 153 rows 62 cols
[2023-03-13 09:55:30] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-13 09:55:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-13 09:55:30] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 09:55:30] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 09:55:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 09:55:30] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 09:55:30] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-13 09:55:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-13 09:55:30] [INFO ] After 109ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-13 09:55:30] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2023-03-13 09:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-13 09:55:31] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2023-03-13 09:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-13 09:55:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-13 09:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-13 09:55:31] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-13 09:55:31] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 167/167 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 167
Applied a total of 8 rules in 21 ms. Remains 58 /62 variables (removed 4) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 58/62 places, 167/167 transitions.
Incomplete random walk after 10000 steps, including 684 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-13 09:55:32] [INFO ] Flow matrix only has 152 transitions (discarded 15 similar events)
// Phase 1: matrix 152 rows 58 cols
[2023-03-13 09:55:32] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-13 09:55:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 09:55:32] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 09:55:32] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 09:55:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 09:55:32] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 09:55:32] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 09:55:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-13 09:55:32] [INFO ] After 81ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-13 09:55:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2023-03-13 09:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-13 09:55:33] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2023-03-13 09:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-13 09:55:33] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-13 09:55:33] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 2 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 167/167 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 56 transition count 169
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 56 transition count 169
Applied a total of 6 rules in 12 ms. Remains 56 /58 variables (removed 2) and now considering 169/167 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 56/58 places, 169/167 transitions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Finished probabilistic random walk after 189115 steps, run visited all 11 properties in 506 ms. (steps per millisecond=373 )
Probabilistic random walk after 189115 steps, saw 35474 distinct states, run finished after 507 ms. (steps per millisecond=373 ) properties seen :11
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA HealthRecord-PT-12-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:55:34] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:55:34] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:55:34] [INFO ] Input system was already deterministic with 243 transitions.
Computed a total of 12 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 65 transition count 131
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 65 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 56 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 56 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 56 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 52 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 52 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 159 place count 52 transition count 88
Applied a total of 159 rules in 11 ms. Remains 52 /124 variables (removed 72) and now considering 88/243 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 52/124 places, 88/243 transitions.
[2023-03-13 09:55:34] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:34] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:55:34] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 67 transition count 135
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 67 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 59 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 59 transition count 119
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 59 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 57 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 57 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 55 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 55 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 152 place count 55 transition count 95
Applied a total of 152 rules in 11 ms. Remains 55 /124 variables (removed 69) and now considering 95/243 (removed 148) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 55/124 places, 95/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Graph (trivial) has 175 edges and 124 vertex of which 8 / 124 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 62 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 62 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 125 place count 52 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 135 place count 52 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 144 place count 52 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 49 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 153 place count 46 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 156 place count 46 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 165 place count 46 transition count 77
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 46 transition count 74
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 44 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 43 transition count 71
Applied a total of 173 rules in 34 ms. Remains 43 /124 variables (removed 81) and now considering 71/243 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 43/124 places, 71/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 75 transition count 149
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 75 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 68 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 68 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 118 place count 68 transition count 129
Applied a total of 118 rules in 5 ms. Remains 68 /124 variables (removed 56) and now considering 129/243 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 68/124 places, 129/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 74 transition count 148
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 74 transition count 148
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 65 transition count 130
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 65 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 126 place count 65 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 64 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 64 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 63 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 63 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 63 transition count 115
Applied a total of 132 rules in 7 ms. Remains 63 /124 variables (removed 61) and now considering 115/243 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 63/124 places, 115/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 70 transition count 140
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 70 transition count 140
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 64 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 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 129 place count 64 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 63 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 63 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 62 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 62 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 62 transition count 111
Applied a total of 136 rules in 6 ms. Remains 62 /124 variables (removed 62) and now considering 111/243 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 62/124 places, 111/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 67 transition count 134
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 67 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 60 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 60 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 134 place count 60 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 58 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 56 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 56 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 148 place count 56 transition count 98
Applied a total of 148 rules in 6 ms. Remains 56 /124 variables (removed 68) and now considering 98/243 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 56/124 places, 98/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 65 transition count 130
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 65 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 56 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 56 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 53 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 50 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 166 place count 50 transition count 79
Applied a total of 166 rules in 7 ms. Remains 50 /124 variables (removed 74) and now considering 79/243 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 50/124 places, 79/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 67 transition count 134
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 67 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 59 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 59 transition count 118
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 59 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 58 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 58 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 57 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 57 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 143 place count 57 transition count 104
Applied a total of 143 rules in 5 ms. Remains 57 /124 variables (removed 67) and now considering 104/243 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 57/124 places, 104/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 68 transition count 137
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 68 transition count 137
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 60 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 60 transition count 121
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 60 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 140 place count 57 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 143 place count 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 146 place count 54 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 149 place count 54 transition count 97
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 156 place count 54 transition count 90
Applied a total of 156 rules in 7 ms. Remains 54 /124 variables (removed 70) and now considering 90/243 (removed 153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 54/124 places, 90/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Graph (trivial) has 160 edges and 124 vertex of which 8 / 124 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 70 transition count 144
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 70 transition count 144
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 109 place count 62 transition count 128
Iterating global reduction 0 with 8 rules applied. Total rules applied 117 place count 62 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 123 place count 62 transition count 122
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 62 transition count 119
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 1 with 6 rules applied. Total rules applied 132 place count 59 transition count 116
Applied a total of 132 rules in 17 ms. Remains 59 /124 variables (removed 65) and now considering 116/243 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 59/124 places, 116/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 243/243 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 69 transition count 139
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 69 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 117 place count 62 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 124 place count 62 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 62 transition count 117
Applied a total of 132 rules in 4 ms. Remains 62 /124 variables (removed 62) and now considering 117/243 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 62/124 places, 117/243 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:55:35] [INFO ] Input system was already deterministic with 117 transitions.
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:55:35] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:55:35] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 09:55:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 243 transitions and 690 arcs took 2 ms.
Total runtime 18064 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: 124 NrTr: 243 NrArc: 690)

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

net check time: 0m 0.000sec

init dd package: 0m 3.714sec


RS generation: 1m 2.885sec


-> reachability set: #nodes 712905 (7.1e+05) #states 222,736,084 (8)



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

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

abstracting: (1<=p4)
states: 19,644,352 (7)
abstracting: (p4<=1)
states: 222,736,084 (8)
abstracting: (0<=p119)
states: 222,736,084 (8)
abstracting: (p119<=0)
states: 213,525,364 (8)

before gc: list nodes free: 1380632

after gc: idd nodes used:1252095, unused:62747905; list nodes free:273367542
.
EG iterations: 1
.........
EG iterations: 9
-> the formula is FALSE

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

MC time: 4m 7.537sec

checking: AX [EF [EG [AG [[[p58<=0 & 0<=p58] & [p1<=1 & 1<=p1]]]]]]
normalized: ~ [EX [~ [E [true U EG [~ [E [true U ~ [[[p1<=1 & 1<=p1] & [p58<=0 & 0<=p58]]]]]]]]]]

abstracting: (0<=p58)
states: 222,736,084 (8)
abstracting: (p58<=0)
states: 182,392,308 (8)
abstracting: (1<=p1)
states: 11
abstracting: (p1<=1)
states: 222,736,084 (8)
.
EG iterations: 1

before gc: list nodes free: 28091

after gc: idd nodes used:1180906, unused:62819094; list nodes free:296836744

before gc: list nodes free: 16448060

after gc: idd nodes used:1380156, unused:62619844; list nodes free:295971358
MC time: 4m59.088sec

checking: [[AX [AX [EX [[p42<=1 & 1<=p42]]]] | AG [[p123<=0 & 0<=p123]]] | [EF [[p22<=1 & 1<=p22]] | EG [AX [AX [[p39<=1 & 1<=p39]]]]]]
normalized: [[~ [EX [EX [~ [EX [[p42<=1 & 1<=p42]]]]]] | ~ [E [true U ~ [[p123<=0 & 0<=p123]]]]] | [EG [~ [EX [EX [~ [[p39<=1 & 1<=p39]]]]]] | E [true U [p22<=1 & 1<=p22]]]]

abstracting: (1<=p22)
states: 7,670,304 (6)
abstracting: (p22<=1)
states: 222,736,084 (8)
abstracting: (1<=p39)
states: 24,541,796 (7)
abstracting: (p39<=1)
states: 222,736,084 (8)
.
before gc: list nodes free: 6256920

after gc: idd nodes used:2026840, unused:61973160; list nodes free:293103967
..
EG iterations: 1
abstracting: (0<=p123)
states: 222,736,084 (8)
abstracting: (p123<=0)
states: 204,431,815 (8)
MC time: 4m32.080sec

checking: EF [EG [AF [[AF [[p25<=0 & 0<=p25]] & [[p35<=1 & 1<=p35] & AX [[[p71<=0 & 0<=p71] | [p24<=1 & 1<=p24]]]]]]]]
normalized: E [true U EG [~ [EG [~ [[[~ [EX [~ [[[p24<=1 & 1<=p24] | [p71<=0 & 0<=p71]]]]] & [p35<=1 & 1<=p35]] & ~ [EG [~ [[p25<=0 & 0<=p25]]]]]]]]]]

abstracting: (0<=p25)
states: 222,736,084 (8)
abstracting: (p25<=0)
states: 206,619,468 (8)
..........
EG iterations: 10
abstracting: (1<=p35)
states: 13,030,128 (7)
abstracting: (p35<=1)
states: 222,736,084 (8)
abstracting: (0<=p71)
states: 222,736,084 (8)
abstracting: (p71<=0)
states: 221,038,372 (8)
abstracting: (1<=p24)
states: 16,113,544 (7)
abstracting: (p24<=1)
states: 222,736,084 (8)
.
before gc: list nodes free: 8808838

after gc: idd nodes used:2133976, unused:61866024; list nodes free:292426417
.
EG iterations: 1
..........
EG iterations: 10
-> the formula is TRUE

FORMULA HealthRecord-PT-12-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m30.705sec

checking: AX [EF [[AX [1<=0] & [AF [[[p89<=0 & 0<=p89] & [p86<=1 & 1<=p86]]] & ~ [A [[[p95<=0 & 0<=p95] | [p122<=1 & 1<=p122]] U [[p41<=0 & 0<=p41] | [p8<=1 & 1<=p8]]]]]]]]
normalized: ~ [EX [~ [E [true U [[~ [[~ [EG [~ [[[p8<=1 & 1<=p8] | [p41<=0 & 0<=p41]]]]] & ~ [E [~ [[[p8<=1 & 1<=p8] | [p41<=0 & 0<=p41]]] U [~ [[[p122<=1 & 1<=p122] | [p95<=0 & 0<=p95]]] & ~ [[[p8<=1 & 1<=p8] | [p41<=0 & 0<=p41]]]]]]]] & ~ [EG [~ [[[p86<=1 & 1<=p86] & [p89<=0 & 0<=p89]]]]]] & ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (0<=p89)
states: 222,736,084 (8)
abstracting: (p89<=0)
states: 216,405,844 (8)
abstracting: (1<=p86)
states: 7
abstracting: (p86<=1)
states: 222,736,084 (8)
...
EG iterations: 3
abstracting: (0<=p41)
states: 222,736,084 (8)
abstracting: (p41<=0)
states: 183,421,276 (8)
abstracting: (1<=p8)
states: 19,651,520 (7)
abstracting: (p8<=1)
states: 222,736,084 (8)
abstracting: (0<=p95)
states: 222,736,084 (8)
abstracting: (p95<=0)
states: 222,541,684 (8)
abstracting: (1<=p122)
states: 12,710,084 (7)
abstracting: (p122<=1)
states: 222,736,084 (8)
abstracting: (0<=p41)
states: 222,736,084 (8)
abstracting: (p41<=0)
states: 183,421,276 (8)
abstracting: (1<=p8)
states: 19,651,520 (7)
abstracting: (p8<=1)
states: 222,736,084 (8)
abstracting: (0<=p41)
states: 222,736,084 (8)
abstracting: (p41<=0)
states: 183,421,276 (8)
abstracting: (1<=p8)
states: 19,651,520 (7)
abstracting: (p8<=1)
states: 222,736,084 (8)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 1m 1.481sec

checking: [AF [EG [EF [[[p47<=0 & 0<=p47] | [p27<=1 & 1<=p27]]]]] & EX [EG [[AG [EF [[[p55<=0 & 0<=p55] | [p77<=1 & 1<=p77]]]] | [[EF [[p38<=1 & 1<=p38]] | EX [0<=0]] & [p94<=1 & 1<=p94]]]]]]
normalized: [EX [EG [[[[p94<=1 & 1<=p94] & [EX [0<=0] | E [true U [p38<=1 & 1<=p38]]]] | ~ [E [true U ~ [E [true U [[p77<=1 & 1<=p77] | [p55<=0 & 0<=p55]]]]]]]]] & ~ [EG [~ [EG [E [true U [[p27<=1 & 1<=p27] | [p47<=0 & 0<=p47]]]]]]]]

abstracting: (0<=p47)
states: 222,736,084 (8)
abstracting: (p47<=0)
states: 188,892,700 (8)
abstracting: (1<=p27)
states: 16,116,616 (7)
abstracting: (p27<=1)
states: 222,736,084 (8)

before gc: list nodes free: 1335004

after gc: idd nodes used:2356548, unused:61643452; list nodes free:291582034

EG iterations: 0
.
EG iterations: 1
abstracting: (0<=p55)
states: 222,736,084 (8)
abstracting: (p55<=0)
states: 167,591,276 (8)
abstracting: (1<=p77)
states: 1
abstracting: (p77<=1)
states: 222,736,084 (8)
abstracting: (1<=p38)
states: 24,541,796 (7)
abstracting: (p38<=1)
states: 222,736,084 (8)
MC time: 4m39.051sec

checking: AX [[AG [E [EG [[p11<=1 & 1<=p11]] U [AX [[[p37<=0 & 0<=p37] | [p72<=1 & 1<=p72]]] | [[p85<=0 & 0<=p85] | [p40<=1 & 1<=p40]]]]] & [[p66<=0 & 0<=p66] | [p73<=1 & 1<=p73]]]]
normalized: ~ [EX [~ [[[[p73<=1 & 1<=p73] | [p66<=0 & 0<=p66]] & ~ [E [true U ~ [E [EG [[p11<=1 & 1<=p11]] U [[[p40<=1 & 1<=p40] | [p85<=0 & 0<=p85]] | ~ [EX [~ [[[p72<=1 & 1<=p72] | [p37<=0 & 0<=p37]]]]]]]]]]]]]]

abstracting: (0<=p37)
states: 222,736,084 (8)
abstracting: (p37<=0)
states: 210,290,260 (8)
abstracting: (1<=p72)
states: 1,791,312 (6)
abstracting: (p72<=1)
states: 222,736,084 (8)

before gc: list nodes free: 21136743

after gc: idd nodes used:3072001, unused:60927999; list nodes free:288362518
.abstracting: (0<=p85)
states: 222,736,084 (8)
abstracting: (p85<=0)
states: 222,703,048 (8)
abstracting: (1<=p40)
states: 14,046,864 (7)
abstracting: (p40<=1)
states: 222,736,084 (8)
abstracting: (1<=p11)
states: 19,644,352 (7)
abstracting: (p11<=1)
states: 222,736,084 (8)
..........
EG iterations: 10
abstracting: (0<=p66)
states: 222,736,084 (8)
abstracting: (p66<=0)
states: 176,847,336 (8)
abstracting: (1<=p73)
states: 1,733,712 (6)
abstracting: (p73<=1)
states: 222,736,084 (8)
.-> the formula is TRUE

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

MC time: 2m55.918sec

checking: [AX [EX [AF [[p119<=1 & 1<=p119]]]] | [EG [[[AF [[[p43<=0 & 0<=p43] | [p9<=1 & 1<=p9]]] | [p21<=1 & 1<=p21]] | [[p122<=0 & 0<=p122] | [p99<=1 & 1<=p99]]]] & EX [EX [~ [E [[p33<=1 & 1<=p33] U [p92<=0 & 0<=p92]]]]]]]
normalized: [[EX [EX [~ [E [[p33<=1 & 1<=p33] U [p92<=0 & 0<=p92]]]]] & EG [[[[p99<=1 & 1<=p99] | [p122<=0 & 0<=p122]] | [[p21<=1 & 1<=p21] | ~ [EG [~ [[[p9<=1 & 1<=p9] | [p43<=0 & 0<=p43]]]]]]]]] | ~ [EX [~ [EX [~ [EG [~ [[p119<=1 & 1<=p119]]]]]]]]]

abstracting: (1<=p119)
states: 9,210,720 (6)
abstracting: (p119<=1)
states: 222,736,084 (8)

before gc: list nodes free: 4252450

after gc: idd nodes used:4221914, unused:59778086; list nodes free:282367635
.
EG iterations: 1
..abstracting: (0<=p43)
states: 222,736,084 (8)
abstracting: (p43<=0)
states: 167,052,066 (8)
abstracting: (1<=p9)
states: 19,644,352 (7)
abstracting: (p9<=1)
states: 222,736,084 (8)
..........
EG iterations: 10
abstracting: (1<=p21)
states: 8,218,608 (6)
abstracting: (p21<=1)
states: 222,736,084 (8)
abstracting: (0<=p122)
states: 222,736,084 (8)
abstracting: (p122<=0)
states: 210,026,000 (8)
abstracting: (1<=p99)
states: 6,330,240 (6)
abstracting: (p99<=1)
states: 222,736,084 (8)
.
EG iterations: 1
abstracting: (0<=p92)
states: 222,736,084 (8)
abstracting: (p92<=0)
states: 213,470,872 (8)
abstracting: (1<=p33)
states: 11
abstracting: (p33<=1)
states: 222,736,084 (8)

before gc: list nodes free: 1208690

after gc: idd nodes used:4345923, unused:59654077; list nodes free:299548650
MC time: 4m27.174sec

checking: AG [[A [[~ [[EF [[p61<=0 & 0<=p61]] & [[p68<=0 & 0<=p68] | [p89<=1 & 1<=p89]]]] | [EF [[p69<=1 & 1<=p69]] & [[p36<=0 & 0<=p36] | [p74<=1 & 1<=p74]]]] U EG [~ [EF [[p7<=1 & 1<=p7]]]]] | [[p37<=0 & 0<=p37] | [p29<=1 & 1<=p29]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [EG [~ [E [true U [p7<=1 & 1<=p7]]]]]]] & ~ [E [~ [EG [~ [E [true U [p7<=1 & 1<=p7]]]]] U [~ [EG [~ [E [true U [p7<=1 & 1<=p7]]]]] & ~ [[[[[p74<=1 & 1<=p74] | [p36<=0 & 0<=p36]] & E [true U [p69<=1 & 1<=p69]]] | ~ [[[[p89<=1 & 1<=p89] | [p68<=0 & 0<=p68]] & E [true U [p61<=0 & 0<=p61]]]]]]]]]] | [[p29<=1 & 1<=p29] | [p37<=0 & 0<=p37]]]]]]

abstracting: (0<=p37)
states: 222,736,084 (8)
abstracting: (p37<=0)
states: 210,290,260 (8)
abstracting: (1<=p29)
states: 16,116,616 (7)
abstracting: (p29<=1)
states: 222,736,084 (8)
abstracting: (0<=p61)
states: 222,736,084 (8)
abstracting: (p61<=0)
states: 176,859,688 (8)
abstracting: (0<=p68)
states: 222,736,084 (8)
abstracting: (p68<=0)
states: 177,696,608 (8)
abstracting: (1<=p89)
states: 6,330,240 (6)
abstracting: (p89<=1)
states: 222,736,084 (8)
abstracting: (1<=p69)
states: 4
abstracting: (p69<=1)
states: 222,736,084 (8)

before gc: list nodes free: 34859024

after gc: idd nodes used:5123333, unused:58876667; list nodes free:296132713
MC time: 3m43.012sec

checking: AF [[A [[[p65<=0 & 0<=p65] | [p83<=1 & 1<=p83]] U EF [[p101<=1 & 1<=p101]]] | A [EX [[[EG [[p105<=1 & 1<=p105]] | [p83<=1 & 1<=p83]] | [[p86<=0 & 0<=p86] | [p83<=1 & 1<=p83]]]] U [[EG [[p81<=1 & 1<=p81]] & ~ [[p14<=1 & 1<=p14]]] | ~ [AF [[[p93<=0 & 0<=p93] | [p75<=1 & 1<=p75]]]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [E [true U [p101<=1 & 1<=p101]]]]] & ~ [E [~ [E [true U [p101<=1 & 1<=p101]]] U [~ [[[p83<=1 & 1<=p83] | [p65<=0 & 0<=p65]]] & ~ [E [true U [p101<=1 & 1<=p101]]]]]]] | [~ [EG [~ [[EG [~ [[[p75<=1 & 1<=p75] | [p93<=0 & 0<=p93]]]] | [~ [[p14<=1 & 1<=p14]] & EG [[p81<=1 & 1<=p81]]]]]]] & ~ [E [~ [[EG [~ [[[p75<=1 & 1<=p75] | [p93<=0 & 0<=p93]]]] | [~ [[p14<=1 & 1<=p14]] & EG [[p81<=1 & 1<=p81]]]]] U [~ [EX [[[[p86<=0 & 0<=p86] | [p83<=1 & 1<=p83]] | [[p83<=1 & 1<=p83] | EG [[p105<=1 & 1<=p105]]]]]] & ~ [[EG [~ [[[p75<=1 & 1<=p75] | [p93<=0 & 0<=p93]]]] | [~ [[p14<=1 & 1<=p14]] & EG [[p81<=1 & 1<=p81]]]]]]]]]]]]]

abstracting: (1<=p81)
states: 1
abstracting: (p81<=1)
states: 222,736,084 (8)
.
EG iterations: 1
abstracting: (1<=p14)
states: 6,081,496 (6)
abstracting: (p14<=1)
states: 222,736,084 (8)
abstracting: (0<=p93)
states: 222,736,084 (8)
abstracting: (p93<=0)
states: 222,541,684 (8)
abstracting: (1<=p75)
states: 7,520,048 (6)
abstracting: (p75<=1)
states: 222,736,084 (8)
.......
EG iterations: 7
abstracting: (1<=p105)
states: 194,400 (5)
abstracting: (p105<=1)
states: 222,736,084 (8)
.......
EG iterations: 7
abstracting: (1<=p83)
states: 57,534,932 (7)
abstracting: (p83<=1)
states: 222,736,084 (8)
abstracting: (1<=p83)
states: 57,534,932 (7)
abstracting: (p83<=1)
states: 222,736,084 (8)
abstracting: (0<=p86)
states: 222,736,084 (8)
abstracting: (p86<=0)
states: 222,736,077 (8)
.abstracting: (1<=p81)
states: 1
abstracting: (p81<=1)
states: 222,736,084 (8)
.
EG iterations: 1
abstracting: (1<=p14)
states: 6,081,496 (6)
abstracting: (p14<=1)
states: 222,736,084 (8)
abstracting: (0<=p93)
states: 222,736,084 (8)
abstracting: (p93<=0)
states: 222,541,684 (8)
abstracting: (1<=p75)
states: 7,520,048 (6)
abstracting: (p75<=1)
states: 222,736,084 (8)
.......
EG iterations: 7
MC time: 3m15.090sec

checking: A [[EG [[p5<=0 & 0<=p5]] | ~ [[~ [A [[[p30<=0 & 0<=p30] | [p42<=1 & 1<=p42]] U [[p18<=0 & 0<=p18] | [p97<=1 & 1<=p97]]]] & [[[[[p7<=0 & 0<=p7] | [p62<=1 & 1<=p62]] & A [[p82<=0 & 0<=p82] U [p120<=1 & 1<=p120]]] | AF [[[p26<=0 & 0<=p26] | [p38<=1 & 1<=p38]]]] & ~ [A [[p53<=1 & 1<=p53] U [[p49<=0 & 0<=p49] | [p28<=1 & 1<=p28]]]]]]]] U ~ [EF [AG [EX [[p20<=0 & 0<=p20]]]]]]
normalized: [~ [EG [E [true U ~ [E [true U ~ [EX [[p20<=0 & 0<=p20]]]]]]]] & ~ [E [E [true U ~ [E [true U ~ [EX [[p20<=0 & 0<=p20]]]]]] U [~ [[~ [[[~ [[~ [EG [~ [[[p28<=1 & 1<=p28] | [p49<=0 & 0<=p49]]]]] & ~ [E [~ [[[p28<=1 & 1<=p28] | [p49<=0 & 0<=p49]]] U [~ [[p53<=1 & 1<=p53]] & ~ [[[p28<=1 & 1<=p28] | [p49<=0 & 0<=p49]]]]]]]] & [~ [EG [~ [[[p38<=1 & 1<=p38] | [p26<=0 & 0<=p26]]]]] | [[~ [EG [~ [[p120<=1 & 1<=p120]]]] & ~ [E [~ [[p120<=1 & 1<=p120]] U [~ [[p82<=0 & 0<=p82]] & ~ [[p120<=1 & 1<=p120]]]]]] & [[p62<=1 & 1<=p62] | [p7<=0 & 0<=p7]]]]] & ~ [[~ [EG [~ [[[p97<=1 & 1<=p97] | [p18<=0 & 0<=p18]]]]] & ~ [E [~ [[[p97<=1 & 1<=p97] | [p18<=0 & 0<=p18]]] U [~ [[[p42<=1 & 1<=p42] | [p30<=0 & 0<=p30]]] & ~ [[[p97<=1 & 1<=p97] | [p18<=0 & 0<=p18]]]]]]]]]] | EG [[p5<=0 & 0<=p5]]]] & E [true U ~ [E [true U ~ [EX [[p20<=0 & 0<=p20]]]]]]]]]]

abstracting: (0<=p20)
states: 222,736,084 (8)
abstracting: (p20<=0)
states: 214,575,796 (8)
.
before gc: list nodes free: 26993813

after gc: idd nodes used:5152712, unused:58847288; list nodes free:295984698
MC time: 2m51.059sec

checking: ~ [E [AF [[p118<=0 & 0<=p118]] U [[~ [A [AF [[[0<=p91 & p91<=0] | [p21<=1 & 1<=p21]]] U [[[p56<=0 & 0<=p56] | [p100<=1 & 1<=p100]] | [[p23<=0 & 0<=p23] | [p67<=1 & 1<=p67]]]]] & [[EX [[p76<=1 & 1<=p76]] | [~ [EF [[p82<=1 & 1<=p82]]] | ~ [[p13<=1 & 1<=p13]]]] | [[p47<=0 & 0<=p47] | [[[p33<=1 & 1<=p33] & [[p6<=0 & 0<=p6] | [[p39<=0 & 0<=p39] | [p68<=1 & 1<=p68]]]] | [[p65<=1 & 1<=p65] & [[p63<=0 & 0<=p63] | [p80<=1 & 1<=p80]]]]]]] & EF [~ [[[p23<=0 & 0<=p23] | [p21<=1 & 1<=p21]]]]]]]
normalized: ~ [E [~ [EG [~ [[p118<=0 & 0<=p118]]]] U [E [true U ~ [[[p21<=1 & 1<=p21] | [p23<=0 & 0<=p23]]]] & [[[[[[[p80<=1 & 1<=p80] | [p63<=0 & 0<=p63]] & [p65<=1 & 1<=p65]] | [[[[p68<=1 & 1<=p68] | [p39<=0 & 0<=p39]] | [p6<=0 & 0<=p6]] & [p33<=1 & 1<=p33]]] | [p47<=0 & 0<=p47]] | [[~ [[p13<=1 & 1<=p13]] | ~ [E [true U [p82<=1 & 1<=p82]]]] | EX [[p76<=1 & 1<=p76]]]] & ~ [[~ [EG [~ [[[[p67<=1 & 1<=p67] | [p23<=0 & 0<=p23]] | [[p100<=1 & 1<=p100] | [p56<=0 & 0<=p56]]]]]] & ~ [E [~ [[[[p67<=1 & 1<=p67] | [p23<=0 & 0<=p23]] | [[p100<=1 & 1<=p100] | [p56<=0 & 0<=p56]]]] U [EG [~ [[[p21<=1 & 1<=p21] | [0<=p91 & p91<=0]]]] & ~ [[[[p67<=1 & 1<=p67] | [p23<=0 & 0<=p23]] | [[p100<=1 & 1<=p100] | [p56<=0 & 0<=p56]]]]]]]]]]]]]

abstracting: (0<=p56)
states: 222,736,084 (8)
abstracting: (p56<=0)
states: 166,635,636 (8)
abstracting: (1<=p100)
states: 9,305,916 (6)
abstracting: (p100<=1)
states: 222,736,084 (8)
abstracting: (0<=p23)
states: 222,736,084 (8)
abstracting: (p23<=0)
states: 214,744,564 (8)
abstracting: (1<=p67)
states: 45,888,748 (7)
abstracting: (p67<=1)
states: 222,736,084 (8)
abstracting: (p91<=0)
states: 216,405,844 (8)
abstracting: (0<=p91)
states: 222,736,084 (8)
abstracting: (1<=p21)
states: 8,218,608 (6)
abstracting: (p21<=1)
states: 222,736,084 (8)
.......
EG iterations: 7
abstracting: (0<=p56)
states: 222,736,084 (8)
abstracting: (p56<=0)
states: 166,635,636 (8)
abstracting: (1<=p100)
states: 9,305,916 (6)
abstracting: (p100<=1)
states: 222,736,084 (8)
abstracting: (0<=p23)
states: 222,736,084 (8)
abstracting: (p23<=0)
states: 214,744,564 (8)
abstracting: (1<=p67)
states: 45,888,748 (7)
abstracting: (p67<=1)
states: 222,736,084 (8)
abstracting: (0<=p56)
states: 222,736,084 (8)
abstracting: (p56<=0)
states: 166,635,636 (8)
abstracting: (1<=p100)
states: 9,305,916 (6)
abstracting: (p100<=1)
states: 222,736,084 (8)
abstracting: (0<=p23)
states: 222,736,084 (8)
abstracting: (p23<=0)
states: 214,744,564 (8)
abstracting: (1<=p67)
states: 45,888,748 (7)
abstracting: (p67<=1)
states: 222,736,084 (8)
.........
EG iterations: 9
abstracting: (1<=p76)
states: 35,297,424 (7)
abstracting: (p76<=1)
states: 222,736,084 (8)
.abstracting: (1<=p82)
states: 1
abstracting: (p82<=1)
states: 222,736,084 (8)

before gc: list nodes free: 37289270

after gc: idd nodes used:6165835, unused:57834165; list nodes free:291446569
MC time: 2m29.012sec

checking: AX [EF [EG [AG [[[p58<=0 & 0<=p58] & [p1<=1 & 1<=p1]]]]]]
normalized: ~ [EX [~ [E [true U EG [~ [E [true U ~ [[[p58<=0 & 0<=p58] & [p1<=1 & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 11
abstracting: (p1<=1)
states: 222,736,084 (8)
abstracting: (0<=p58)
states: 222,736,084 (8)
abstracting: (p58<=0)
states: 182,392,308 (8)
.
EG iterations: 1

before gc: list nodes free: 34657479

after gc: idd nodes used:6053991, unused:57946009; list nodes free:292011094

before gc: list nodes free: 33644679

after gc: idd nodes used:6291056, unused:57708944; list nodes free:290977141
.-> the formula is TRUE

FORMULA HealthRecord-PT-12-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m29.226sec

checking: [[AX [AX [EX [[p42<=1 & 1<=p42]]]] | AG [[p123<=0 & 0<=p123]]] | [EF [[p22<=1 & 1<=p22]] | EG [AX [AX [[p39<=1 & 1<=p39]]]]]]
normalized: [[~ [EX [EX [~ [EX [[p42<=1 & 1<=p42]]]]]] | ~ [E [true U ~ [[p123<=0 & 0<=p123]]]]] | [EG [~ [EX [EX [~ [[p39<=1 & 1<=p39]]]]]] | E [true U [p22<=1 & 1<=p22]]]]

abstracting: (1<=p22)
states: 7,670,304 (6)
abstracting: (p22<=1)
states: 222,736,084 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5605028 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101044 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.001sec

14085 15995
iterations count:220810 (908), effective:12307 (50)

initing FirstDep: 0m 0.002sec


iterations count:2843 (11), effective:177 (0)

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

sat_reach.icc:155: Timeout: after 298 sec


iterations count:4884 (20), effective:296 (1)

sat_reach.icc:155: Timeout: after 271 sec


iterations count:4830 (19), effective:292 (1)

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

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

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

sat_reach.icc:155: Timeout: after 278 sec


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

sat_reach.icc:155: Timeout: after 255 sec


iterations count:32767 (134), effective:1683 (6)

sat_reach.icc:155: Timeout: after 222 sec


sat_reach.icc:155: Timeout: after 194 sec


sat_reach.icc:155: Timeout: after 170 sec


iterations count:1751 (7), effective:92 (0)

sat_reach.icc:155: Timeout: after 148 sec


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

iterations count:42337 (174), effective:2292 (9)

iterations count:4884 (20), effective:296 (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-12"
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-12, 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-167840348500321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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