Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640602100697.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602100697
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 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-01-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716489769183

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:42:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 18:42:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:42:50] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-23 18:42:50] [INFO ] Transformed 117 places.
[2024-05-23 18:42:50] [INFO ] Transformed 218 transitions.
[2024-05-23 18:42:50] [INFO ] Found NUPN structural information;
[2024-05-23 18:42:50] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Support contains 65 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 97 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 97 transition count 174
Applied a total of 40 rules in 55 ms. Remains 97 /117 variables (removed 20) and now considering 174/213 (removed 39) transitions.
[2024-05-23 18:42:50] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
// Phase 1: matrix 167 rows 97 cols
[2024-05-23 18:42:50] [INFO ] Computed 13 invariants in 7 ms
[2024-05-23 18:42:50] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-23 18:42:50] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2024-05-23 18:42:50] [INFO ] Invariant cache hit.
[2024-05-23 18:42:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:42:51] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-23 18:42:51] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2024-05-23 18:42:51] [INFO ] Invariant cache hit.
[2024-05-23 18:42:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 11 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:42:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:42:54] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:55] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:42:55] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:56] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:42:56] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:56] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 166/263 variables, 97/145 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:42:57] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (OVERLAPS) 1/264 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 15 (OVERLAPS) 0/264 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 147 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 166/263 variables, 97/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 173/319 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:43:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:03] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 1/264 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:43:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/264 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-23 18:43:10] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 14 (OVERLAPS) 0/264 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 324 constraints, problems are : Problem set: 0 solved, 173 unsolved in 13785 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 40/40 constraints]
After SMT, in 24412ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 24431ms
Starting structural reductions in LTL mode, iteration 1 : 97/117 places, 174/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24871 ms. Remains : 97/117 places, 174/213 transitions.
Support contains 65 out of 97 places after structural reductions.
[2024-05-23 18:43:15] [INFO ] Flatten gal took : 33 ms
[2024-05-23 18:43:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-01-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:43:15] [INFO ] Flatten gal took : 13 ms
[2024-05-23 18:43:15] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 63 out of 97 places (down from 65) after GAL structural reductions.
RANDOM walk for 40000 steps (2096 resets) in 2038 ms. (19 steps per ms) remains 5/53 properties
BEST_FIRST walk for 40004 steps (324 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (319 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (326 resets) in 118 ms. (336 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (315 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (334 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
[2024-05-23 18:43:16] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2024-05-23 18:43:16] [INFO ] Invariant cache hit.
[2024-05-23 18:43:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/97 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 18:43:16] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 6 (OVERLAPS) 166/263 variables, 97/111 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/264 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 112 constraints, problems are : Problem set: 1 solved, 3 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/64 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-23 18:43:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
[2024-05-23 18:43:17] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 6 (OVERLAPS) 32/97 variables, 6/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 166/263 variables, 97/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/264 variables, 1/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/264 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 115 constraints, problems are : Problem set: 3 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 423ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 133 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 333 edges and 90 vertex of which 84 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 84 transition count 147
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 79 transition count 140
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 77 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 77 transition count 135
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 33 place count 70 transition count 135
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 63 place count 40 transition count 75
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 40 transition count 75
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 31 transition count 57
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 31 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 115 place count 31 transition count 53
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 28 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 28 transition count 44
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 124 place count 25 transition count 38
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 25 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 25 transition count 35
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 5 with 2 rules applied. Total rules applied 132 place count 24 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 140 place count 20 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 20 transition count 48
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 151 place count 20 transition count 48
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 20 transition count 48
Applied a total of 159 rules in 42 ms. Remains 20 /97 variables (removed 77) and now considering 48/174 (removed 126) transitions.
Running 40 sub problems to find dead transitions.
[2024-05-23 18:43:17] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 20 cols
[2024-05-23 18:43:17] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 18:43:17] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 47/67 variables, 20/24 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 12/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 36 constraints, problems are : Problem set: 9 solved, 31 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 3/4 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 47/67 variables, 20/24 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 12/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 31/67 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 67 constraints, problems are : Problem set: 9 solved, 31 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 31/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 9 solved, 31 unsolved
Search for dead transitions found 9 dead transitions in 678ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/97 places, 39/174 transitions.
Graph (complete) has 62 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 39
Applied a total of 3 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 724 ms. Remains : 19/97 places, 39/174 transitions.
RANDOM walk for 21484 steps (7100 resets) in 541 ms. (39 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA HealthRecord-PT-01-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:43:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 11 ms
FORMULA HealthRecord-PT-01-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 9 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 54 out of 97 places (down from 57) after GAL structural reductions.
Computed a total of 9 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 118 edges and 97 vertex of which 12 / 97 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 57 transition count 107
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 57 transition count 107
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 73 place count 51 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 79 place count 51 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 81 place count 51 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 48 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 46 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 46 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 46 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 46 transition count 75
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 2 with 2 rules applied. Total rules applied 98 place count 45 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 43 transition count 72
Applied a total of 100 rules in 21 ms. Remains 43 /97 variables (removed 54) and now considering 72/174 (removed 102) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 43/97 places, 72/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 60 transition count 106
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 60 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 53 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 52 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 51 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 51 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 51 transition count 83
Applied a total of 96 rules in 7 ms. Remains 51 /97 variables (removed 46) and now considering 83/174 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/97 places, 83/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 58 transition count 102
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 58 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 50 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 50 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 49 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 49 transition count 79
Applied a total of 100 rules in 6 ms. Remains 49 /97 variables (removed 48) and now considering 79/174 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/97 places, 79/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 60 transition count 105
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 60 transition count 105
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 53 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 53 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 53 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 50 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 50 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 47 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 47 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 47 transition count 72
Applied a total of 104 rules in 6 ms. Remains 47 /97 variables (removed 50) and now considering 72/174 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 47/97 places, 72/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 65 transition count 115
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 65 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 59 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 59 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 59 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 56 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 56 transition count 92
Applied a total of 84 rules in 5 ms. Remains 56 /97 variables (removed 41) and now considering 92/174 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/97 places, 92/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 132 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 53 transition count 100
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 53 transition count 100
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 82 place count 44 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 91 place count 44 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 44 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 41 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 41 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 38 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 38 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 38 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 38 transition count 56
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 2 with 2 rules applied. Total rules applied 116 place count 37 transition count 55
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 34 transition count 52
Applied a total of 119 rules in 17 ms. Remains 34 /97 variables (removed 63) and now considering 52/174 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 34/97 places, 52/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 58 transition count 101
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 58 transition count 101
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 49 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 49 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 49 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 47 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 47 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 45 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 45 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 45 transition count 67
Applied a total of 110 rules in 6 ms. Remains 45 /97 variables (removed 52) and now considering 67/174 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 45/97 places, 67/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 62 transition count 110
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 62 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 55 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 55 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 55 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 52 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 52 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 49 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 49 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 49 transition count 77
Applied a total of 100 rules in 6 ms. Remains 49 /97 variables (removed 48) and now considering 77/174 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/97 places, 77/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 60 transition count 105
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 60 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 55 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 55 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 55 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 53 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 51 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 51 transition count 84
Applied a total of 93 rules in 5 ms. Remains 51 /97 variables (removed 46) and now considering 84/174 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/97 places, 84/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 57 transition count 100
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 57 transition count 100
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 48 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 48 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 45 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 45 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 42 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 42 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 117 place count 42 transition count 60
Applied a total of 117 rules in 4 ms. Remains 42 /97 variables (removed 55) and now considering 60/174 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/97 places, 60/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 64 transition count 113
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 64 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 59 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 59 transition count 103
Applied a total of 76 rules in 2 ms. Remains 59 /97 variables (removed 38) and now considering 103/174 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/97 places, 103/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 129 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 55 transition count 103
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 55 transition count 103
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 78 place count 46 transition count 85
Iterating global reduction 0 with 9 rules applied. Total rules applied 87 place count 46 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 92 place count 46 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 43 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 43 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 41 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 41 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 41 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 41 transition count 61
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 2 with 2 rules applied. Total rules applied 110 place count 40 transition count 60
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 37 transition count 57
Applied a total of 113 rules in 14 ms. Remains 37 /97 variables (removed 60) and now considering 57/174 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 37/97 places, 57/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 133 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 53 transition count 99
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 53 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 83 place count 43 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 93 place count 43 transition count 79
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 98 place count 43 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 40 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 40 transition count 65
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 37 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 37 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 37 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 37 transition count 52
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 2 with 2 rules applied. Total rules applied 119 place count 36 transition count 51
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 33 transition count 48
Applied a total of 122 rules in 11 ms. Remains 33 /97 variables (removed 64) and now considering 48/174 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 33/97 places, 48/174 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:43:18] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 6 ms
[2024-05-23 18:43:18] [INFO ] Flatten gal took : 6 ms
[2024-05-23 18:43:18] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 18:43:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 174 transitions and 466 arcs took 2 ms.
Total runtime 28047 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-01

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 97
TRANSITIONS: 174
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 690
MODEL NAME: /home/mcc/execution/412/model
97 places, 174 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-01-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716489799404

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-01"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-01, 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 r179-tall-171640602100697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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