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-171640602100698.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602100698
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716489812169

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:43:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 18:43:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:43:33] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-23 18:43:33] [INFO ] Transformed 117 places.
[2024-05-23 18:43:33] [INFO ] Transformed 218 transitions.
[2024-05-23 18:43:33] [INFO ] Found NUPN structural information;
[2024-05-23 18:43:33] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 107 transition count 195
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 107 transition count 195
Applied a total of 20 rules in 20 ms. Remains 107 /117 variables (removed 10) and now considering 195/213 (removed 18) transitions.
[2024-05-23 18:43:33] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 107 cols
[2024-05-23 18:43:33] [INFO ] Computed 12 invariants in 28 ms
[2024-05-23 18:43:33] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-23 18:43:33] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-23 18:43:33] [INFO ] Invariant cache hit.
[2024-05-23 18:43:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:43:34] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-23 18:43:34] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-23 18:43:34] [INFO ] Invariant cache hit.
[2024-05-23 18:43:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 12 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-23 18:43:35] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:43:36] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 3 ms to minimize.
[2024-05-23 18:43:37] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:38] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:43:38] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:43:38] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:38] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:38] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:43:39] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:39] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-05-23 18:43:39] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:43:39] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:40] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:40] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:43:40] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:41] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:43:41] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 188/295 variables, 107/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 1/296 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (OVERLAPS) 0/296 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 170 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11517 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 188/295 variables, 107/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 194/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/296 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-23 18:43:50] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 0/296 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 365 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12309 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 51/51 constraints]
After SMT, in 23923ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 23948ms
Starting structural reductions in LTL mode, iteration 1 : 107/117 places, 195/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24363 ms. Remains : 107/117 places, 195/213 transitions.
Support contains 85 out of 107 places after structural reductions.
[2024-05-23 18:43:58] [INFO ] Flatten gal took : 34 ms
[2024-05-23 18:43:58] [INFO ] Flatten gal took : 14 ms
[2024-05-23 18:43:58] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 83 out of 107 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (2098 resets) in 1793 ms. (22 steps per ms) remains 29/78 properties
BEST_FIRST walk for 4003 steps (30 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (27 resets) in 47 ms. (83 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (31 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (30 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (29 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (30 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (28 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (32 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
[2024-05-23 18:43:59] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-23 18:43:59] [INFO ] Invariant cache hit.
[2024-05-23 18:43:59] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 48/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 31/107 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 8 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:43:59] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 16/28 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 5/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 3/38 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:44:00] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 4/42 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:01] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:44:01] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 188/295 variables, 107/151 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 1/296 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/296 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 152 constraints, problems are : Problem set: 1 solved, 20 unsolved in 2534 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 49/74 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:01] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:44:01] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:44:01] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:44:01] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 5/20 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 33/107 variables, 6/30 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 23/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 188/295 variables, 107/160 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 20/180 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 1/181 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:44:03] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 2/183 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:44:03] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 1/296 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/296 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/296 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 185 constraints, problems are : Problem set: 1 solved, 20 unsolved in 2628 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 45/45 constraints]
After SMT, in 5172ms problems are : Problem set: 1 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 16 properties in 1620 ms.
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 131 edges and 107 vertex of which 12 / 107 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 363 edges and 101 vertex of which 96 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 96 transition count 171
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 17 place count 91 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 90 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 89 transition count 163
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 22 place count 89 transition count 160
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 30 place count 84 transition count 160
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 70 place count 44 transition count 80
Iterating global reduction 4 with 40 rules applied. Total rules applied 110 place count 44 transition count 80
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 120 place count 34 transition count 60
Iterating global reduction 4 with 10 rules applied. Total rules applied 130 place count 34 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 134 place count 34 transition count 56
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 137 place count 31 transition count 47
Iterating global reduction 5 with 3 rules applied. Total rules applied 140 place count 31 transition count 47
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 143 place count 28 transition count 41
Iterating global reduction 5 with 3 rules applied. Total rules applied 146 place count 28 transition count 41
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 149 place count 28 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 155 place count 25 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 25 transition count 48
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 25 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 160 place count 23 transition count 46
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 167 place count 23 transition count 46
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 173 place count 23 transition count 46
Applied a total of 173 rules in 41 ms. Remains 23 /107 variables (removed 84) and now considering 46/195 (removed 149) transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 46 rows 23 cols
[2024-05-23 18:44:05] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 18:44:05] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 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
At refinement iteration 4 (OVERLAPS) 46/69 variables, 23/28 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 7/35 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 35 constraints, problems are : Problem set: 7 solved, 31 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 4/5 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 46/69 variables, 23/28 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 7/35 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 31/66 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/66 constraints. Problems are: Problem set: 7 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/66 constraints. Problems are: Problem set: 7 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 66 constraints, problems are : Problem set: 7 solved, 31 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 31/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 7 solved, 31 unsolved
Search for dead transitions found 7 dead transitions in 701ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/107 places, 39/195 transitions.
Graph (complete) has 68 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 39
Applied a total of 2 rules in 5 ms. Remains 22 /23 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 748 ms. Remains : 22/107 places, 39/195 transitions.
RANDOM walk for 40000 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 620 steps, run visited all 4 properties in 13 ms. (steps per millisecond=47 )
Probabilistic random walk after 620 steps, saw 200 distinct states, run finished after 24 ms. (steps per millisecond=25 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA HealthRecord-PT-01-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 9 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 9 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 195 transitions.
Computed a total of 12 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 59 transition count 104
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 59 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 51 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 51 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 49 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 49 transition count 79
Applied a total of 119 rules in 6 ms. Remains 49 /107 variables (removed 58) and now considering 79/195 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/107 places, 79/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 66 transition count 118
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 66 transition count 118
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 56 transition count 98
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 56 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 56 transition count 97
Applied a total of 103 rules in 5 ms. Remains 56 /107 variables (removed 51) and now considering 97/195 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/107 places, 97/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 68 transition count 122
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 68 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 63 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 63 transition count 112
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 63 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 62 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 62 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 61 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 61 transition count 104
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 61 transition count 103
Applied a total of 96 rules in 7 ms. Remains 61 /107 variables (removed 46) and now considering 103/195 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 61/107 places, 103/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 66 transition count 117
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 66 transition count 117
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 58 transition count 101
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 58 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 58 transition count 99
Applied a total of 100 rules in 5 ms. Remains 58 /107 variables (removed 49) and now considering 99/195 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/107 places, 99/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 60 transition count 106
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 60 transition count 106
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 104 place count 50 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 114 place count 50 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 50 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 44 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 44 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 131 place count 44 transition count 66
Applied a total of 131 rules in 7 ms. Remains 44 /107 variables (removed 63) and now considering 66/195 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 44/107 places, 66/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 148 edges and 107 vertex of which 12 / 107 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 56 transition count 105
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 56 transition count 105
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 47 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 110 place count 47 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 45 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 45 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 43 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 43 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 120 place count 43 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 43 transition count 66
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 130 place count 41 transition count 64
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 38 transition count 61
Applied a total of 133 rules in 21 ms. Remains 38 /107 variables (removed 69) and now considering 61/195 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 38/107 places, 61/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 149 edges and 107 vertex of which 14 / 107 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 57 transition count 107
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 57 transition count 107
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 96 place count 48 transition count 89
Iterating global reduction 0 with 9 rules applied. Total rules applied 105 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 108 place count 48 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 45 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 45 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 43 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 43 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 43 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 127 place count 43 transition count 64
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 37 transition count 58
Applied a total of 139 rules in 17 ms. Remains 37 /107 variables (removed 70) and now considering 58/195 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 37/107 places, 58/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 153 edges and 107 vertex of which 14 / 107 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 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 55 transition count 104
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 55 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 46 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 46 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 111 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 44 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 44 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 42 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 42 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 42 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 128 place count 42 transition count 63
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 132 place count 40 transition count 61
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 36 transition count 57
Applied a total of 136 rules in 15 ms. Remains 36 /107 variables (removed 71) and now considering 57/195 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 36/107 places, 57/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 2 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 57 transitions.
RANDOM walk for 40000 steps (4032 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (690 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 688 steps, run visited all 1 properties in 6 ms. (steps per millisecond=114 )
Probabilistic random walk after 688 steps, saw 261 distinct states, run finished after 6 ms. (steps per millisecond=114 ) properties seen :1
FORMULA HealthRecord-PT-01-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 111
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 95 place count 56 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 102 place count 56 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 104 place count 56 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 55 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 54 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 54 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 54 transition count 89
Applied a total of 109 rules in 5 ms. Remains 54 /107 variables (removed 53) and now considering 89/195 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 54/107 places, 89/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 61 transition count 108
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 61 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 54 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 52 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 51 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 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 115 place count 51 transition count 83
Applied a total of 115 rules in 4 ms. Remains 51 /107 variables (removed 56) and now considering 83/195 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 51/107 places, 83/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 58 transition count 102
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 58 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 50 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 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 118 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 49 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 49 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 48 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 48 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 48 transition count 76
Applied a total of 123 rules in 4 ms. Remains 48 /107 variables (removed 59) and now considering 76/195 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 48/107 places, 76/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 120 edges and 107 vertex of which 12 / 107 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 64 transition count 118
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 64 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 80 place count 59 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 85 place count 59 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 86 place count 59 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 59 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 54 transition count 96
Applied a total of 102 rules in 12 ms. Remains 54 /107 variables (removed 53) and now considering 96/195 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 54/107 places, 96/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 61 transition count 108
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 61 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 54 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 53 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 52 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 52 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 52 transition count 86
Applied a total of 113 rules in 3 ms. Remains 52 /107 variables (removed 55) and now considering 86/195 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 52/107 places, 86/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 111
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 55 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 54 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 54 transition count 89
Applied a total of 109 rules in 3 ms. Remains 54 /107 variables (removed 53) and now considering 89/195 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/107 places, 89/195 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:44:07] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 7 ms
[2024-05-23 18:44:07] [INFO ] Flatten gal took : 7 ms
[2024-05-23 18:44:07] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-23 18:44:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 195 transitions and 506 arcs took 2 ms.
Total runtime 34210 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/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 107
TRANSITIONS: 195
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]


SAVING FILE /home/mcc/execution/406/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: 847
MODEL NAME: /home/mcc/execution/406/model
107 places, 195 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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-01-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-01-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716489848929

--------------------
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 CTLFireability -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="CTLFireability"
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 CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640602100698"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;